#include <bits/stdc++.h>
using namespace std;
const int N = 105, mod = 1e9 + 7;
int n;
int g[N][N], a[N][N], ans[N];
int ksm(int A, int B) {
  int x = 1;
  for (; B; B& 1 ? x = 1ll * x * A % mod : 0, A = 1ll * A * A % mod, B >>= 1)
    ;
  return x;
}
int mtree() {
  int res = 1;
  for (int i = 1; i < n; i++) {
    for (int j = i + 1; j < n; j++)
      if (a[j][i] != 0) {
        swap(a[i], a[j]);
        res = -res;
        break;
      }
    if (a[i][i] == 0) return 0;
    int inv = ksm(a[i][i], mod - 2);
    for (int j = i + 1; j < n; j++) {
      int d = 1ll * a[j][i] * inv % mod;
      for (int k = i; k < n; k++) (a[j][k] -= 1ll * d * a[i][k] % mod) %= mod;
    }
    res = 1ll * res * a[i][i] % mod;
  }
  return res;
}
void guass() {
  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++)
      if (a[j][i] != 0) {
        swap(a[i], a[j]);
        break;
      }
    int inv = ksm(a[i][i], mod - 2);
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      int d = 1ll * a[j][i] * inv % mod;
      for (int k = 1; k <= n + 1; k++)
        (a[j][k] -= 1ll * d * a[i][k] % mod) %= mod;
    }
  }
}
void print() {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n + 1; j++) printf("%d ", a[i][j]);
    puts(" ");
  }
}
int main() {
  int x, y;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &x, &y);
    g[x][y] = g[y][x] = 1;
  }
  for (int x = 1; x <= n; x++) {
    memset(a, 0, sizeof(a));
    for (int i = 1; i <= n; i++)
      for (int j = i + 1; j <= n; j++) {
        int d = (g[i][j] ? x : 1);
        (a[i][i] += d) %= mod;
        (a[j][j] += d) %= mod;
        (a[i][j] -= d) %= mod;
        (a[j][i] -= d) %= mod;
      }
    ans[x] = mtree();
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1, k = 1; j <= n; j++, k = 1ll * k * i % mod) a[i][j] = k;
  for (int i = 1; i <= n; i++) a[i][n + 1] = ans[i];
  guass();
  for (int i = 1; i <= n; i++) {
    int ans = 1ll * a[i][n + 1] * ksm(a[i][i], mod - 2) % mod;
    printf("%d ", (ans + mod) % mod);
  }
  return 0;
}
