#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void gmax(T &x, T y) {
  x = x > y ? x : y;
}
template <typename T>
inline void gmin(T &x, T y) {
  x = x < y ? x : y;
}
const int mod = 1000000007;
inline int add(int x, int y) {
  x += y;
  return x >= mod ? x - mod : x;
}
inline int sub(int x, int y) {
  x -= y;
  return x < 0 ? x + mod : x;
}
inline int mul(int x, int y) { return (long long)x * y % mod; }
inline int pow(int a, int x) {
  int ret = 1;
  for (; x; x >>= 1, a = mul(a, a))
    if (x & 1) ret = mul(ret, a);
  return ret;
}
const int MAXN = 105;
int calc(int a[MAXN][MAXN], int n) {
  int ret = 1;
  for (int i = 0; i < n; i++) {
    int inv = pow(a[i][i], mod - 2);
    for (int j = i + 1; j < n; j++) {
      int t = mul(a[j][i], inv);
      for (int k = i; k < n; k++) a[j][k] = sub(a[j][k], mul(a[i][k], t));
    }
    ret = mul(ret, a[i][i]);
  }
  return ret;
}
int MatrixTree(int a[MAXN][MAXN], int n) { return calc(a, n - 1); }
int n;
int g[MAXN][MAXN];
int e[MAXN][2];
void init(int v) {
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) g[i][j] = i == j ? n - 1 : sub(0, 1);
  for (int i = 1; i < n; i++) {
    int x = e[i][0], y = e[i][1];
    g[x][y] = g[y][x] = sub(0, v);
    g[x][x] = add(g[x][x], sub(v, 1));
    g[y][y] = add(g[y][y], sub(v, 1));
  }
}
int f[MAXN][MAXN];
int p[MAXN], ans[MAXN];
void gauss(int a[MAXN][MAXN], int n) {
  for (int i = 0; i < n; i++) {
    if (!a[i][i]) {
      for (int j = i + 1; j < n; j++)
        if (a[j][i]) {
          for (int k = i; k <= n; k++) swap(a[i][k], a[j][k]);
          swap(p[i], p[j]);
          break;
        }
    }
    int inv = pow(a[i][i], mod - 2);
    for (int j = 0; j < n; j++)
      if (j != i) {
        int t = mul(a[j][i], inv);
        for (int k = i; k <= n; k++) a[j][k] = sub(a[j][k], mul(a[i][k], t));
      }
  }
  for (int i = 0; i < n; i++) ans[p[i]] = mul(a[i][n], pow(a[i][i], mod - 2));
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--;
    y--;
    e[i][0] = x;
    e[i][1] = y;
  }
  for (int i = 0; i < n; i++) {
    init(i);
    f[i][0] = 1;
    for (int j = 1; j < n; j++) f[i][j] = mul(f[i][j - 1], i);
    f[i][n] = MatrixTree(g, n);
    p[i] = i;
  }
  gauss(f, n);
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  return 0;
}
