#include <bits/stdc++.h>
#define int int64_t

using std::cin;
using std::cout;
const char endl = '\n';

const int p = 998244353;
int fac[503] = {1};

std::vector<int> edge[502];
std::vector<int> son[502];
int sz[502];
int fa[502];
int subt[502];
void dfs(int u) {
  sz[u] = subt[u] = 1;
  for (auto &v : edge[u]) {
    if (v == fa[u]) continue;
    fa[v] = u;
    son[u].push_back(v);
    dfs(v);
    sz[u] += sz[v];
  }
  for (auto &v : son[u]) subt[u] = subt[u] * subt[v] % p;
  subt[u] = subt[u] * fac[son[u].size()] % p;
}

int Ans[502][502];

int n;

int ans[1000][1000];

void ddfs(int u) {
  int bp[1000][1000];
  // std::vector<std::vector<int>> bp(1000, std::vector<int>(1000, 0));
  // memset(bp, 0, sizeof(bp));
  for (int i = 0; i < 1000; ++i)
    for (int j = 0; j < 1000; ++j) bp[i][j] = 0;
  bp[0][0] = 1;
  for (auto &v : son[u]) {
    for (int j = 500; j >= sz[v]; --j) {
      for (int k = 500; k; --k)
        bp[j][k] = (bp[j][k] + bp[j - sz[v]][k - 1] % p) % p;
    }
  }
  // for (int i = 0; i <= 500; i++) {
  //   for (int j = 0; j <= 500; j++)
  //     if (bp[i][j]) std::cerr << bp[i][j] << " \n"[j == 500];
  // }
  for (auto &v : son[u]) {
    for (int i = 0; i < 502; ++i)
      for (int j = 0; j < 502; ++j) ans[i][j] = bp[i][j];
    // auto ans = bp;
    for (int j = 0; j <= sz[u]; ++j) {
      for (int k = 0; k <= (int)son[u].size(); ++k) {
        if (j >= sz[v] and k >= 1)
          ans[j][k] = ((ans[j][k] - ans[j - sz[v]][k - 1]) % p + p) % p;
      }
    }
    int base = 1;
    for (auto vv : son[u])
      if (vv != v) base = base * subt[vv] % p;
    std::vector<int> anssj(502);
    for (int j = 0; j + sz[v] <= sz[u]; ++j) {
      for (int k = 0; k < (int)son[u].size(); ++k) {
        anssj[j] =
          (anssj[j] + ans[j][k] * fac[k] % p * fac[son[u].size() - k - 1] % p) %
          p;
      }
      anssj[j] = anssj[j] * base % p;
    }
    for (int j = 0; j < n; ++j) {
      for (int l = 0; l <= j; ++l) {
        Ans[v][j + 1] = (Ans[v][j + 1] + Ans[u][l] * anssj[j - l] % p) % p;
      }
    }
    ddfs(v);
  }
}

void solve() {
  for (int i = 1; i <= 500; ++i) fac[i] = fac[i - 1] * i % p;
  cin >> n;
  for (int i = 1, u, v; i < n; ++i) {
    cin >> u >> v;
    edge[u].push_back(v);
    edge[v].push_back(u);
  }
  dfs(1);
  Ans[1][1] = 1;
  ddfs(1);
  for (int u = 1; u <= n; ++u) {
    for (int j = 1; j <= n; ++j)
      cout << Ans[u][j] * subt[u] % p << " \n"[j == n];
  }
}

int32_t main() {
#ifndef _DEBUG
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
#endif
  int tc = 1;
  // std::cin >> tc;
  while (tc--) solve();
#ifdef _DEBUG
  std::cout << std::endl;
  std::cout << "Time used: " << clock() << "ms" << std::endl;
  system("pause");
  return 0;
#endif
}