#include <bits/stdc++.h>
#pragma GCC optimize(3)
#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,A=18,mod=998244353; typedef long long ll;
int n,C[N][N],f[N][N],sf[N][N],deg[N],cnt[N],g[1<<A],h[1<<A][N],tmp[1<<A][N]; vector<int> to[N];
inline int ID(int x) { return (x&1)?mod-1:1; }
inline void qmo(int& x) { x+=(x>>31)&mod; }
inline bool ckmin(int& x,int y) { if(x>y) return x=y,true; else return false; }
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 lfcnt=0; for(int v:to[u]) if(v!=pa&&!deg[v]) lfcnt++;
    int B=0,ww=1e9; For(i,0,n) if(i<A&&cnt[n]-cnt[i]<=A&&ckmin(ww,pow(2,i)*i+pow(2,i+cnt[n]-cnt[i])*deg[u]*lfcnt)) B=i;
    vector<int> lis; for(int v:to[u]) if(v!=pa&&deg[v]>B) lis.push_back(v); ; int sz=lis.size();
    assert(B<A&&sz<=A);
    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)) qmo(cc+=f[v][i]-mod); ; g[s]=1ll*g[s]*cc%mod;
        }
    }
    For(i,0,B) For(s,0,all) if(!((s>>i)&1)) g[s]=(g[s]+1ll*(mod-1)*g[s|(1<<i)])%mod;
    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,deg[u]){
            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; ; qmo(f[u][i]+=w-mod);
                }
            }
            For(s,0,all2) For(j,0,lfcnt) tmp[s][j]=h[s][j];
            For(s,0,all2) Rev(j,lfcnt,0) if(h[s][j]) For(k,j+1,lfcnt) h[s][k]=(h[s][k]+1ll*h[s][j]*C[lfcnt-j][lfcnt-k])%mod;
            For(j,0,lfcnt) For(k,0,sz-1) For(s,0,all2) if(!((s>>k)&1)) h[s|(1<<k)][j]=(h[s|(1<<k)][j]+1ll*h[s][j]*f[lis[k]][i])%mod;
            if(i>B||((ss>>i)&1)) For(s,0,all2) For(j,0,lfcnt) qmo(h[s][j]-=tmp[s][j]);
        }
    }
    Rev(i,n,0) sf[u][i]=(sf[u][i+1]+f[u][i])%mod;
}
signed main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    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(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