#include <bits/stdc++.h>
const int N = 105, mod = 1e9 + 7;
using namespace std;
inline int Getint() {
  register int x = 0, f = 1;
  register char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, a[N][N], mp[N][N];
int Gauss() {
  int ans = 1;
  for (int i = 1; i < n; i++) {
    for (int j = i + 1; j < n; j++)
      while (a[j][i]) {
        int t = a[i][i] / a[j][i];
        for (int k = i; k < n; k++)
          a[i][k] = (a[i][k] - (long long)t * a[j][k] % mod + mod) % mod;
        swap(a[i], a[j]);
        ans = -ans;
      }
    ans = (long long)ans * a[i][i] % mod;
  }
  return (ans + mod) % mod;
}
int ksm(int x, int k) {
  int ret = 1;
  while (k) {
    if (k & 1) ret = (long long)ret * x % mod;
    x = (long long)x * x % mod, k >>= 1;
  }
  return ret;
}
int g[N][N], ans[N];
void _Gauss() {
  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++)
      while (g[j][i]) {
        int t = g[i][i] / g[j][i];
        for (int k = i; k <= n + 1; k++)
          g[i][k] = (g[i][k] - (long long)t * g[j][k] % mod + mod) % mod;
        swap(g[i], g[j]);
      }
    g[i][i] = (g[i][i] + mod) % mod;
  }
  for (int i = n; i; i--) {
    for (int j = n; j > i; j--)
      (g[i][n + 1] -= (long long)g[i][j] * ans[j] % mod) %= mod;
    ans[i] = (long long)g[i][n + 1] * ksm(g[i][i], mod - 2) % mod;
  }
  for (int i = 1; i <= n; i++) cout << (ans[i] + mod) % mod << ' ';
}
int main() {
  n = Getint();
  for (int i = 1; i < n; i++) {
    int x = Getint(), y = Getint();
    mp[x][y] = mp[y][x] = 1;
  }
  for (int k = 1; k <= n; k++) {
    memset(a, 0, sizeof(a));
    for (int i = 1; i <= n; i++) {
      for (int j = i + 1; j <= n; j++) {
        if (mp[i][j]) {
          a[i][i] += k, a[j][j] += k;
          a[i][j] -= k, a[j][i] -= k;
        } else {
          a[i][i]++, a[j][j]++;
          a[i][j]--, a[j][i]--;
        }
      }
    }
    for (int i = 1, x = 1; i <= n; i++, x = (long long)x * k % mod) g[k][i] = x;
    g[k][n + 1] = Gauss();
  }
  _Gauss();
  return 0;
}
