#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
int mul(int a, int b) { return (long long)a * b % MOD; }
const int MAXN = 200 + 10;
int bin[MAXN][MAXN];
int binom(int a, int b) {
  if (!bin[0][0]) {
    for (int i = 0; i < MAXN; i++) {
      bin[i][0] = bin[i][i] = 1;
      for (int j = 1; j < i; j++)
        bin[i][j] = fix(bin[i - 1][j] + bin[i - 1][j - 1]);
    }
  }
  return bin[a][b];
}
vector<int> adj[MAXN];
int n, sz[MAXN];
int dp[MAXN][MAXN][MAXN];
int ndp[MAXN][MAXN];
void dfs(int v, int p) {
  if (~p) adj[v].erase(find(adj[v].begin(), adj[v].end(), p));
  sz[v] = 1;
  dp[v][0][1] = 1;
  for (int u : adj[v]) {
    dfs(u, v);
    memset(ndp, 0, sizeof(ndp));
    for (int a = 0; a < sz[u]; a++) {
      for (int b = 1; b <= sz[u]; b++) {
        for (int c = 0; c < sz[v]; c++) {
          for (int d = 1; d <= sz[v]; d++) {
            add(ndp[a + c][d], mul(b * n, mul(dp[u][a][b], dp[v][c][d])));
            add(ndp[a + c + 1][b + d], mul(dp[u][a][b], dp[v][c][d]));
          }
        }
      }
    }
    sz[v] += sz[u];
    memcpy(dp[v], ndp, sizeof(ndp));
  }
}
int ans[MAXN];
void solve() {
  cin >> n;
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  dfs(0, -1);
  int ninv = pw(n, MOD - 2);
  for (int s = 1; s <= n; s++) {
    for (int e = 0; e < n; e++) {
      add(ans[e], mul(mul(ninv, s), dp[0][e][s]));
    }
  }
  for (int i = n - 2; ~i; --i) {
    for (int j = i + 1; j < n; j++) {
      add(ans[i], -mul(binom(j, i), ans[j]));
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
