#include <bits/stdc++.h>
using namespace std;
const int N = 105, P = 1000000007;
int n, i, j, k, t, x, y, f[N][N], g[N][N], ans[N], fin;
long long a[N][N];
inline int po(int a, int b) {
  int t = 1;
  for (; b; b >>= 1, a = 1LL * a * a % P)
    if (b & 1) t = 1LL * t * a % P;
  return t;
}
long long det(int n) {
  int i, j, k;
  long long ans = 1;
  bool flag = 1;
  for (i = 1; i <= n; i++)
    for (j = 1; j <= n; j++) a[i][j] = (a[i][j] % P + P) % P;
  for (i = 1; i <= n; i++) {
    for (j = i + 1; j <= n; j++)
      while (a[j][i]) {
        long long t = a[i][i] * po(a[j][i], P - 2) % P;
        for (k = i; k <= n; k++) a[i][k] = (a[i][k] + P - t * a[j][k] % P) % P;
        for (k = i; k <= n; k++) swap(a[i][k], a[j][k]);
        flag ^= 1;
      }
    ans = ans * a[i][i] % P;
    if (!ans) return 0;
  }
  if (!flag) ans = P - ans;
  return ans % P;
}
int cal(int w) {
  int i, j;
  for (i = 1; i <= n; i++)
    for (j = 1; j <= n; j++) a[i][j] = 0;
  for (i = 1; i <= n; i++)
    for (j = 1; j < i; j++) {
      int k = po(w, f[i][j]);
      a[i][j] -= k;
      a[j][i] -= k;
      a[i][i] += k;
      a[j][j] += k;
    }
  return det(n - 1);
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++)
    for (j = 1; j <= n; j++) f[i][j] = 0;
  for (i = 1; i < n; i++) {
    scanf("%d%d", &x, &y);
    f[x][y] = f[y][x] = 1;
  }
  for (i = 1; i <= n; i++) {
    g[i][n + 1] = cal(i);
    for (j = 1; j <= n; j++) g[i][j] = po(i, j - 1);
  }
  for (i = 1; i <= n; i++) {
    for (j = i; j <= n; j++)
      if (g[j][i]) break;
    for (k = i; k <= n + 1; k++) swap(g[i][k], g[j][k]);
    for (j = i + 1; j <= n; j++)
      for (t = 1LL * g[j][i] * po(g[i][i], P - 2) % P, k = i; k <= n + 1; k++)
        g[j][k] = ((g[j][k] - 1LL * g[i][k] * t) % P + P) % P;
  }
  for (ans[n] = 1LL * g[n][n + 1] * po(g[n][n], P - 2) % P, i = n - 1; i; i--) {
    for (ans[i] = g[i][n + 1], j = n; j > i; j--)
      ans[i] = ((ans[i] - 1LL * ans[j] * g[i][j]) % P + P) % P;
    ans[i] = 1LL * ans[i] * po(g[i][i], P - 2) % P;
  }
  for (i = 1; i <= n; i++) printf("%d ", ans[i]);
}
