#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 5005;
const int MOD = 1e9 + 7;
ll ans[N];
int dp[N][N];
short sz[N], n;
vector<short> adj[N];
void dfs(short u, short par){
dp[u][0] = sz[u] = 1;
for (short v: adj[u])
if (v != par){
dfs(v, u);
for (short i = sz[u]; i >= 0; --i)
for (short j = 1; j <= sz[v]; ++j)
if (dp[u][i] && dp[v][j])
dp[u][i + j] = (dp[u][i + j] + (dp[u][i] * 1LL * dp[v][j]) % MOD) % MOD;
sz[u] += sz[v];
}
dp[u][1] = sz[u];
}
void reroot(short u, short par){
ans[2] += dp[u][1] - 1;
for (short i = 2; i < n; ++i)
ans[i + 1] += dp[u][i];
vector<ll> f[2];
int sc = sz[u];
for (short i = 0; i <= sz[u]; ++i) f[0].push_back(dp[u][i]);
// cout << "\t\t" << u << "\n";
// for (int i = 1; i <= n; ++i) cout << i << " " << sz[i] << "\n";
// for (int i = 0; i <= sz[u]; ++i) cout << dp[u][i] << " "; cout << '\n';
for (short v: adj[u])
if (v != par){
int tmp = sz[v];
f[1].clear();
for (short i = 1; i <= sz[u]; ++i) dp[u][i] = 0;
for (short i = 0; i <= sz[v]; ++i) f[1].push_back(dp[v][i]);
sz[u] = 1;
for (short w: adj[u])
if (w != v){
for (short i = sz[u]; i >= 0; --i)
for (short j = 1; j <= sz[w]; ++j)
if (dp[u][i] && dp[w][j])
dp[u][i + j] = (dp[u][i + j] + (dp[u][i] * 1LL * dp[w][j]) % MOD) % MOD;
sz[u] += sz[w];
}
dp[u][1] = sz[u];
--dp[v][1];
for (short i = sz[v]; i >= 0; --i)
for (short j = 1; j <= sz[u]; ++j)
if (dp[v][i] && dp[u][j])
dp[v][i + j] = (dp[v][i + j] + (dp[u][j] * 1LL * dp[v][i]) % MOD) % MOD;
sz[v] += sz[u]; dp[v][1] = sz[v];
reroot(v, u);
sz[v] = tmp;
for (short i = 0; i <= sz[v]; ++i) dp[v][i] = f[1][i];
}
sz[u] = sc;
for (short i = 0; i <= sz[u]; ++i) dp[u][i] = f[0][i];
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (short i = 1, u, v; i < n; ++i){
cin >> u >> v;
adj[u].emplace_back(v);
adj[v].emplace_back(u);
}
dfs(1, 1);
reroot(1, 1);
ans[1] = n;
for (short i = 1; i <= n; ++i) cout << ans[i] % MOD << " ";
}
