#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
  uniform_int_distribution<long long> uid(l, r);
  return uid(rng);
}
const int mod = 1e9 + 7;
int pwr(int a, int b) {
  if (b == -1) return pwr(a, mod - 2);
  int ans = 1;
  while (b) {
    if (b & 1) {
      ans = (ans * 1LL * a) % mod;
    }
    a = (a * 1LL * a) % mod;
    b >>= 1;
  }
  return ans;
}
const int N = 105;
int dp[N][N][N];
int sz[N];
vector<int> g[N];
int dp1[N][N];
int fact[N], ifact[N];
void dfs(int u, int p) {
  dp[u][1][1] = 1;
  sz[u] = 1;
  for (int v : g[u]) {
    if (v != p) {
      dfs(v, u);
      for (int a = 1; a <= sz[u] + sz[v]; a++) {
        for (int b = 1; b <= sz[u] + sz[v]; b++) {
          dp1[a][b] = 0;
        }
      }
      for (int a = 1; a <= sz[v]; a++) {
        for (int b = 1; b <= sz[v]; b++) {
          if (!dp[v][a][b]) continue;
          for (int c = 1; c <= sz[u]; c++) {
            for (int d = 1; d <= sz[u]; d++) {
              if (!dp[u][c][d]) continue;
              int val = (dp[u][c][d] * 1LL * dp[v][a][b]) % mod;
              val = (val * 1LL * a) % mod;
              dp1[c][d + b] += val;
              dp1[c][d + b] %= mod;
              dp1[c + a][d + b - 1] += (dp[u][c][d] * 1LL * dp[v][a][b]) % mod;
              dp1[c + a][d + b - 1] %= mod;
            }
          }
        }
      }
      sz[u] += sz[v];
      for (int i = 1; i <= sz[u]; i++) {
        for (int j = 1; j <= sz[u]; j++) {
          dp[u][i][j] = dp1[i][j];
        }
      }
    }
  }
}
int tot[N], ans[N];
int ncr(int n, int k) {
  if (k < 0 || n < k) return 0;
  int val = (fact[n] * 1LL * ifact[k]) % mod;
  return (val * 1LL * ifact[n - k]) % mod;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  fact[0] = 1;
  for (int i = 1; i <= N - 1; i++) {
    fact[i] = (i * 1LL * fact[i - 1]) % mod;
  }
  ifact[N - 1] = pwr(fact[N - 1], mod - 2);
  for (int i = N - 2; i >= 0; i--) {
    ifact[i] = ((i + 1) * 1LL * ifact[i + 1]) % mod;
  }
  int n;
  cin >> n;
  for (int i = 1; i <= n - 1; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, 0);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (!dp[1][i][j]) continue;
      dp[1][i][j] = (dp[1][i][j] * 1LL * i) % mod;
      dp[1][i][j] = (dp[1][i][j] * 1LL * pwr(n, j - 2)) % mod;
      ans[n - j] += dp[1][i][j];
      ans[n - j] %= mod;
    }
  }
  for (int i = n - 1; i >= 0; i--) {
    for (int j = i + 1; j < n; j++) {
      ans[i] += mod - (ans[j] * 1LL * ncr(j, i)) % mod;
      ans[i] %= mod;
    }
  }
  for (int i = 0; i <= n - 1; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
