//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
//#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 998244353
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	int w=1;
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w*x;
}
void write(int x) {
	if(x<0) pc('-'),x=-x;
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
bool vi[509][509];
int N,hd[509],dd[509][509],to[1009],nxt[1009],siz[509],p[509],px[509],k,dp[509][509][509];
inline void l(int u,int v) {nxt[++k]=hd[u],to[k]=v,hd[u]=k;}
inline int md(int a) {
	return a>=MOD?a-MOD:a;
}
void dfs(int n,int f) {
	siz[n]=1;p[n]=1;
	int dg=0;
	vi[n][n]=1;
	for(int i=hd[n];i;i=nxt[i]) {
		if(to[i]==f) continue;
		dfs(to[i],n);
		for(int j=1;j<=N;j++) vi[n][j]|=vi[to[i]][j];
		dg++;
		siz[n]+=siz[to[i]];
		p[n]=1ll*p[n]*p[to[i]]%MOD;
	}
	p[n]=1ll*p[n]*px[dg]%MOD;
	dp[n][n][1]=p[n];
	for(int i=hd[n];i;i=nxt[i]) {
		if(to[i]==f) continue;
		for(int j=0;j<=dg;j++) {
			for(int k=0;k<=siz[n];k++) {
				dd[j][k]=0;
			}
		}
		dd[0][0]=1;
		int aq=1,ss=0,dq=0;
		for(int j=hd[n];j;j=nxt[j]) {
			if(to[j]==f||to[j]==to[i]) continue;
			aq=1ll*aq*p[to[j]]%MOD;
			ss+=siz[to[j]];dq++;
			for(int k=dq;k>=1;k--) {
				for(int l=siz[to[j]];l<=ss;l++) {
					dd[k][l]=md(dd[k][l]+dd[k-1][l-siz[to[j]]]);
				}
			}
		}
		for(int k=0;k<=siz[n];k++) {
			int as=0;
			for(int j=0;j<=dg;j++) {
				if(!dd[j][k]) continue;
				int va=1ll*dd[j][k]*px[j]%MOD*px[dg-j-1]%MOD;
				as=md(as+va);
			}
			as=1ll*as*aq%MOD;
			if(as==0) continue;
			for(int l=1;l<=N;l++) {
				if(!vi[to[i]][l]) continue;
				for(int x=1;x<=siz[to[i]]&&x+k+1<=siz[n];x++) {
					if(dp[to[i]][l][x]) dp[n][l][x+k+1]=md(dp[n][l][x+k+1]+1ll*dp[to[i]][l][x]*as%MOD);
				}
			}
		}
	}
} 
signed main(void) {
//    freopen("m.in","r",stdin);
//    freopen("m.out","w",stdout);
	N=read();
	px[0]=1;
	for(int i=1;i<=N;i++) px[i]=1ll*px[i-1]*i%MOD;	
	for(int i=1;i<N;i++) {
		int u=read(),v=read();
		l(u,v),l(v,u);
	}
	dfs(1,0);
	for(int i=1;i<=N;i++) {
		for(int j=1;j<=N;j++) {
			write(dp[1][i][j]);
			pc(' ');
		}
		pc('\n');
	}
	pcc();
    return 0;
}