#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
using namespace std;
const int N=205,mod=998244353; typedef long long ll;
int n,C[N][N],f[N][N],sf[N][N],deg[N],cnt[N],g[1<<22],h[1<<22][23]; vector<int> to[N];
inline int ID(int x) { return x?mod-1:1; }
void dfs(int u,int pa){
    if(to[u].size()==1u&&pa!=0) { deg[u]=0; For(i,0,n) f[u][i]=1,sf[u][i]=n-i+1; ; return; }
    for(int v:to[u]) if(v!=pa) dfs(v,u),deg[u]++;
    memset(cnt,0,sizeof(cnt)); for(int v:to[u]) if(v!=pa) cnt[deg[v]]++; ; For(i,1,n) cnt[i]+=cnt[i-1];
    int B=0,ww=1e9; For(i,0,21) if(i+cnt[n]-cnt[i]<ww) ww=i+cnt[n]-cnt[i],B=i;
    vector<int> lis; for(int v:to[u]) if(v!=pa&&deg[v]>B) lis.push_back(v); ; int sz=lis.size();
    int lfcnt=0; for(int v:to[u]) if(v!=pa&&!deg[v]) lfcnt++;
    // cerr<<"u="<<u<<": B="<<B<<" sz="<<sz<<endl;
    assert(B<22&&sz<=22);
    const int all=(1<<(B+1))-1; For(s,0,all){
        g[s]=1; for(int v:to[u]) if(v!=pa&&deg[v]<=B&&deg[v]){
            int cc=0; For(i,0,B) if(!((s>>i)&1)) cc=(cc+f[v][i])%mod; ; g[s]=1ll*g[s]*cc%mod;
        }
    }
    For(s,0,all) for(int s0=all^s;s0;s0=(s0-1)&(all^s)) g[s]=(g[s]+1ll*ID(s0)*g[s|s0])%mod;
    // For(s,0,all) cerr<<g[s]<<' '; ; cerr<<endl;
    const int all2=(1<<sz)-1;
    For(ss,0,all) if(g[ss]) {
        For(s,0,all2) For(j,0,lfcnt) h[s][j]=0; ; h[0][0]=g[ss];
        For(i,0,n){
            if(i>B||(i<=B&&((ss>>i)&1))){
                For(s,0,all2) For(j,0,lfcnt) if(h[s][j]){
                    int w=h[s][j]; For(t,0,sz-1) if(!((s>>t)&1)) w=1ll*w*sf[lis[t]][i+1]%mod;
                    For(_,1,lfcnt-j) w=1ll*w*(n-i)%mod;
                    // printf("ss=%d,s=%d: f[%d][%d]+=%d\n",ss,s,u,i,w);
                    f[u][i]=(f[u][i]+w)%mod;
                }
            }
            Rev(s,all2,0) Rev(j,lfcnt,0) if(h[s][j]){
                for(int s0=all2^s;;s0=(s0-1)&(all2^s)){
                    int w=h[s][j]; For(t,0,sz-1) if((s0>>t)&1) w=1ll*w*f[lis[t]][i]%mod;
                    For(k,j+(s0==0),lfcnt) h[s|s0][k]=(h[s|s0][k]+1ll*w*C[lfcnt-j][lfcnt-k])%mod;
                    if(!s0) break;
                }
                h[s][j]=0;
            }
        }
    }
    Rev(i,n,0) sf[u][i]=(sf[u][i+1]+f[u][i])%mod;
}
signed main(){
    cin>>n; For(i,1,n-1) { int x,y; cin>>x>>y; to[x].push_back(y); to[y].push_back(x); }
    C[0][0]=1; For(i,1,n) { C[i][0]=1; For(j,1,i) C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod; } ;  dfs(1,0); 
    // For(u,1,n){
    //     For(i,0,n) cerr<<f[u][i]<<' '; ; cerr<<endl;
    // }
    For(i,0,n) cout<<f[1][i]<<'\n';
    cerr<<"Time = "<<clock()<<" ms\n";
    return 0;
}

// START TYPING IF YOU DON'T KNOW WHAT TO DO