#include <bits/stdc++.h>
using namespace std;
const long long M = 105;
const long long MOD = 1e9 + 7;
long long read() {
  long long num = 0, flag = 1;
  char c;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') flag = -1;
  while (c >= '0' && c <= '9')
    num = (num << 3) + (num << 1) + (c ^ 48), c = getchar();
  return num * flag;
}
long long n, x[M], y[M], z[M], a[M][M], f[M][M];
long long qkpow(long long a, long long b) {
  long long r = 1;
  while (b > 0) {
    if (b & 1) r = r * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return r;
}
long long guass() {
  long long ans = 1;
  for (long long i = 2; i <= n; i++) {
    for (long long j = i + 1; j <= n; j++)
      if (!a[i][i] && a[j][i]) {
        ans = -ans;
        swap(a[i], a[j]);
        break;
      }
    long long inv = qkpow(a[i][i], MOD - 2);
    for (long long j = i + 1; j <= n; j++) {
      long long tmp = a[j][i] * inv % MOD;
      for (long long k = i; k <= n; k++)
        a[j][k] = (a[j][k] - a[i][k] * tmp % MOD) % MOD;
    }
  }
  for (long long i = 2; i <= n; i++) ans = ans * a[i][i] % MOD;
  return (ans + MOD) % MOD;
}
void Guass() {
  for (long long i = 1; i <= n; i++) {
    for (long long j = i + 1; j <= n; j++)
      if (!a[i][i] && a[j][i]) {
        swap(a[i], a[j]);
        break;
      }
    long long inv = qkpow(a[i][i], MOD - 2);
    for (long long j = 1; j <= n; j++) {
      if (!a[j][i] || i == j) continue;
      long long t = a[j][i] * inv % MOD;
      for (long long k = i; k <= n + 1; k++)
        a[j][k] = (a[j][k] - a[i][k] * t) % MOD;
    }
  }
  for (long long i = 1; i <= n; i++) {
    long long t = a[i][n + 1] * qkpow(a[i][i], MOD - 2) % MOD;
    printf("%lld ", (t + MOD) % MOD);
  }
  puts("");
}
signed main() {
  n = read();
  for (long long i = 1; i < n; i++) {
    long long u = read(), v = read();
    f[u][v] = f[v][u] = 1;
  }
  for (long long x = 0; x < n; x++) {
    for (long long i = 1; i <= n; i++)
      for (long long j = i + 1; j <= n; j++) {
        long long v = (f[i][j] ? x : 1);
        a[i][i] += v;
        a[j][j] += v;
        a[i][j] -= v;
        a[j][i] -= v;
      }
    z[x] = guass();
    memset(a, 0, sizeof a);
  }
  for (long long i = 1; i <= n; i++) {
    long long t = 1;
    for (long long j = 1; j <= n; j++) {
      a[i][j] = t;
      t = t * (i - 1) % MOD;
    }
    a[i][n + 1] = z[i - 1];
  }
  Guass();
}
