#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned __int128 u128;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=209,Mod=998244353;
ll n,dp[N][N],leaf[N],mex[N],coef[N][N];
vector<ll>to[N];
void dfs(ll x,ll fa){
    vector<ll>son;
    for(ll y:to[x]){
        if(y==fa)continue;
        son.emplace_back(y);
    }
    if(!son.size())return leaf[x]=1,mex[x]=n,fill(dp[x],dp[x]+n+1,1),void();
    for(ll y:son)dfs(y,x);
    sort(son.begin(),son.end(),[&](ll a,ll b){return mex[a]<mex[b];});
    vector<pair<u128,ll> >v;
    v.emplace_back(make_pair(0,1));
    ll leafc=0;
    for(ll y:son){
        if(leaf[y]){
            leafc++;
            continue;
        }
        vector<pair<u128,ll> >nv;
        for(auto &p:v){
            rep(j,0,mex[y])nv.emplace_back(make_pair(p.first|((u128)1<<j),p.second*dp[y][j]%Mod));
        }
        sort(nv.begin(),nv.end());
        vector<pair<u128,ll> >().swap(v);
        v.emplace_back(nv[0]);
        rep(j,1,(ll)nv.size()-1){
            if(nv[j].first==v.back().first)v.back().second=(v.back().second+nv[j].second)%Mod;
            else v.emplace_back(nv[j]);
        }
    }
    for(auto &p:v){
        ll cur=0;
        rep(j,0,n){
            if(cur>leafc)break;
            dp[x][j]=(dp[x][j]+p.second*coef[leafc][cur])%Mod;
            if(j>=128||!((p.first>>j)&1))cur++;
        }
    }
    rep(i,0,n-1)dp[x][i]=(dp[x][i]-dp[x][i+1]+Mod)%Mod;
    mex[x]=n;
    while(mex[x]>=0&&!dp[x][mex[x]])mex[x]--;
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    n=read();
    rep(i,2,n){
        ll x=read(),y=read();
        to[x].emplace_back(y),to[y].emplace_back(x);
    }
    coef[0][0]=1;
    rep(i,1,n){
        rep(j,0,i){
            coef[i][j]=coef[i-1][j]*(n-j+1)%Mod;
            if(j)coef[i][j]=(coef[i][j]+coef[i-1][j-1]*j)%Mod;
        }
    }
    dfs(1,0);
    rep(i,0,n)write(dp[1][i]),putchar('\n');
    return 0;
}