#include<cstdio>
#include<vector>
#include<cstring>
#define ll long long
#define mo 998244353

using namespace std;

const int N = 550;
int n, sz[N];
vector <int> G[N];
ll jc[N], f[N][N], a[N], ans[N][N], g[N][N], h[N][N], tmp[N];

void dfs0(int now, int father) {
	int size = G[now].size() - (now != 1);
	a[now] = jc[size]; sz[now] = 1;
	for (int i = 0; i < G[now].size(); i++) {
		int x = G[now][i]; if (x == father) continue;
		dfs0(x, now); a[now] = a[now] * a[x] % mo; sz[now] += sz[x];
	}
}

void dfs1(int now, int father) {
	vector <int> e;
	memset(g, 0, sizeof(g));
	for (int i = 0; i < G[now].size(); i++) if (G[now][i] != father) e.push_back(G[now][i]);
	
	g[0][0] = 1;
	for (int i = 1; i <= e.size(); i++) {
		int x = e[i - 1];
		for (int j = i; j >= 1; j--)
			for (int k = sz[x]; k <= n; k++)
				g[j][k] = (g[j][k] + g[j - 1][k - sz[x]]) % mo;
	}
	
	for (int i = 1; i <= e.size(); i++) {
		int x = e[i - 1];
		for (int j = 0; j <= e.size(); j++)
			for (int k = 0; k <= n; k++)
				if (j && k >= sz[x]) h[j][k] = (g[j][k] - h[j - 1][k - sz[x]] + mo) % mo;
					else h[j][k] = g[j][k];
		ll di = 1;
		for (int j = 1; j <= e.size(); j++) if (i != j) di = di * a[e[j - 1]] % mo;
		memset(tmp, 0, sizeof(tmp));
		for (int j = 0; j < e.size(); j++)
			for (int k = 0; k <= n; k++)
				tmp[k] = (tmp[k] + h[j][k] * jc[j] % mo * jc[e.size() - j - 1] % mo) % mo;
		for (int j = 1; j <= n; j++)
			for (int k = 0; j + k < n; k++) if (f[now][j]) {
				f[x][j + k + 1] = (f[x][j + k + 1] + f[now][j] * tmp[k] % mo) % mo; 
			} 
		for (int j = 1; j <= n; j++)
			f[x][j] = f[x][j] * di % mo, ans[x][j] = f[x][j] * a[x] % mo;
	}
	
	for (int i = 0; i < e.size(); i++) {
		int x = e[i];
		dfs1(x, now);
	}
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i < n; i++) {
		int x, y; scanf("%d %d", &x, &y);
		G[x].push_back(y); G[y].push_back(x);
	}
	
	jc[0] = 1; for (int i = 1; i <= n; i++) jc[i] = jc[i - 1] * i % mo;
	
	dfs0(1, 0);
	f[1][1] = 1;
	ans[1][1] = a[1];
	dfs1(1, 0);
	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) printf("%d ", ans[i][j]);
		printf("\n"); 
	}
	
	return 0;
}