#include<bits/stdc++.h>
#define N 510
#define LL long long
#define mod 998244353 
#define rep(i,l,r) for(int i=l;i<=r;i++)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
LL poww(LL x,LL y) {
	LL res=1;
	while(y) {
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return res;
}
int n,sz[N];
vector<int>G[N];
LL g[N],dp[N][N],tmp[N][N],f[N][N];
void dfs1(int x,int fat) {
	g[x]=sz[x]=1;
	int son=0;
	for(auto v:G[x]) if(v!=fat) {
		son++;
		dfs1(v,x);
		sz[x]+=sz[v];
		g[x]=g[x]*son%mod*g[v]%mod;
	}
}
void dfs2(int x,int fat) {
	memset(dp,0,sizeof(dp));
	dp[0][0]=1;
	int son=0,all=0;
	for(auto v:G[x]) if(v!=fat) {
		memcpy(tmp,dp,sizeof(tmp)),memset(dp,0,sizeof(dp));
		rep(i,0,son) rep(j,0,all) if(tmp[i][j]) dp[i][j]=(dp[i][j]+tmp[i][j]*g[v]%mod*(son+1-i))%mod,dp[i+1][j+sz[v]]=(dp[i+1][j+sz[v]]+tmp[i][j]*g[v]%mod*(i+1))%mod;
		all+=sz[v];
		son++;
	}
	for(auto v:G[x]) if(v!=fat) {
		rep(i,0,son) {
			LL tmp=poww(g[v]*(son-i)%mod,mod-2);
			rep(j,0,all) {
				dp[i][j]=dp[i][j]*tmp%mod;
				dp[i+1][j+sz[v]]=(dp[i+1][j+sz[v]]-dp[i][j]*g[v]%mod*(i+1)%mod+mod)%mod;
			}
		}
		
	rep(j,0,all) rep(i,1,son) dp[0][j]=(dp[0][j]+dp[i][j])%mod;
		rep(i,0,n) if(f[x][i]) rep(j,0,all) f[v][i+j+1]=(f[v][i+j+1]+f[x][i]*dp[0][j])%mod;
	rep(j,0,all) rep(i,1,son) dp[0][j]=(dp[0][j]-dp[i][j]+mod)%mod;
		memcpy(tmp,dp,sizeof(tmp)),memset(dp,0,sizeof(dp));
		rep(i,0,son) rep(j,0,all) if(tmp[i][j]) dp[i][j]=(dp[i][j]+tmp[i][j]*g[v]%mod*(son-i))%mod,dp[i+1][j+sz[v]]=(dp[i+1][j+sz[v]]+tmp[i][j]*g[v]%mod*(i+1))%mod;
	}
	for(auto v:G[x]) if(v!=fat) dfs2(v,x);
}
int main() {
//	freopen("C.in","r",stdin);
//	freopen("C.out","w",stdout);
	n=rd();
	for(int i=1,u,v;i<n;i++) {
		u=rd(),v=rd();
		G[u].push_back(v),G[v].push_back(u);
	}
	dfs1(1,0),f[1][1]=1,dfs2(1,0);
	rep(i,1,n) {
		rep(j,1,n) printf("%lld ",f[i][j]*g[i]%mod);puts("");
	}
	return 0;
}