#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool flag = false;
  while (!isdigit(c)) {
    if (c == '-') flag = true;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  if (flag) x = -x;
}
long long n;
long long a[210][210], b[210][210], e[210][210];
long long inv(long long x) {
  long long y = 1000000007 - 2, ans = 1;
  while (y) {
    if (y & 1) ans = ans * x % 1000000007;
    x = x * x % 1000000007;
    y >>= 1;
  }
  return ans;
}
long long det() {
  long long ans = 1;
  for (int i = 1; i < n; ++i) {
    long long p = inv(b[i][i]);
    for (int j = i + 1; j < n; ++j) {
      long long d = b[j][i] * p % 1000000007;
      for (int k = i; k < n; ++k)
        b[j][k] =
            (b[j][k] - b[i][k] * d % 1000000007 + 1000000007) % 1000000007;
    }
    ans = ans * b[i][i] % 1000000007;
    if (!b[i][i]) return 0;
  }
  return ans;
}
void gauss() {
  for (int i = 1; i <= n; ++i) {
    long long d = inv(a[i][i]);
    for (int j = i; j <= n + 1; ++j) a[i][j] = a[i][j] * d % 1000000007;
    for (int j = i + 1; j <= n; ++j) {
      d = a[j][i];
      for (int k = i; k <= n + 1; ++k)
        a[j][k] =
            (a[j][k] - a[i][k] * d % 1000000007 + 1000000007) % 1000000007;
    }
  }
  for (int i = n; i; --i)
    for (int j = i - 1; j; --j)
      a[j][n + 1] =
          (a[j][n + 1] - a[j][i] * a[i][n + 1] % 1000000007 + 1000000007) %
          1000000007;
}
int main() {
  read(n);
  for (int i = 1; i < n; ++i) {
    int x, y;
    read(x), read(y);
    e[x][y] = e[y][x] = 1;
  }
  for (int i = 1; i <= n; ++i) {
    a[i][1] = 1;
    for (int j = 2; j <= n; ++j) a[i][j] = a[i][j - 1] * i % 1000000007;
  }
  for (int k = 1; k <= n; ++k) {
    for (int i = 1; i <= n; ++i) {
      b[i][i] = 0;
      for (int j = 1; j <= n; ++j) {
        if (i == j) continue;
        if (e[i][j])
          b[i][j] = 1000000007 - k, b[i][i] += k;
        else
          b[i][j] = 1000000007 - 1, b[i][i]++;
      }
    }
    a[k][n + 1] = det();
  }
  gauss();
  for (int i = 1; i <= n; ++i) printf("%lld ", a[i][n + 1]);
  return 0;
}
