#include<bits/stdc++.h>
#define ll long long
#define il inline
#define pn putchar('\n')
#define maxint 2147483647
#define min(x,y) (x<y?x:y)
#define max(x,y) (x>y?x:y)
#define maxn 200005
#define int ll
#define mod 998244353
using namespace std;
struct Gragh
{
    int v,nex;
}e[maxn<<1];
int n,top;
int c[maxn],f[maxn],cd[maxn];
il void build_gra(int u,int v)
{
    e[++top]=(Gragh){v,c[u]},c[u]=top;
}
il int ksm(int x,int y)
{
    int ret=1;
    while(y)
    {
        if(y&1)ret=ret*x%mod;
        x=x*x%mod,y>>=1;
    }
    return ret;
}
il void upd(int &x,int y)
{
    x+=y;
    while(x>=mod)x-=mod;
    while(x<0)x+=mod;
}
il void dfs(int pos,int fa=0)
{
    if(!c[pos])
    {
        f[pos]=1;
        return;
    }
    for(int i=c[pos];i;i=e[i].nex)
    {
        int v=e[i].v;
        if(v==fa)continue;
        cd[pos]++;
        dfs(v,pos);
        upd(f[pos],f[v]+1);
    }
    f[pos]=f[pos]*ksm(cd[pos],mod-2)%mod;
}
il void rdfs(int pos,int fa=0)
{
    for(int i=c[pos];i;i=e[i].nex)
    {
        int v=e[i].v;
        if(v==fa)continue;
        int tmp=f[pos]*cd[pos];
        upd(tmp,-f[v]-1);
        tmp=tmp*ksm(cd[pos]-1,mod-2)%mod;
        f[v]=f[v]*cd[v]%mod;
        upd(f[v],tmp+1);
        cd[v]++;
        f[v]=f[v]*ksm(cd[v],mod-2)%mod;
        rdfs(v,pos);
    }
}
signed main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    scanf("%lld",&n);
    for(int i=1;i<n;i++)
    {
        int u,v;
        scanf("%lld%lld",&u,&v);
        build_gra(u,v),build_gra(v,u);
    }
    dfs(1);
    rdfs(1);
    for(int i=1;i<=n;i++)
        printf("%lld\n",f[i]);
    return 0;
}