#include<bits/stdc++.h>
using namespace std;
struct edge{int v,nxt;}e[400005];
int h[200005],siz[200005],f[200005],g[200005],cnt,n,u,v,inv[200005];
const int mod=998244353;
void Add(int &x,int y){x=(x+y>=mod?x+y-mod:x+y);}
void add(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
void dfs1(int u,int fa)
{
	siz[u]=0;f[u]=1;
	for(int i=h[u];i;i=e[i].nxt)
	{
		int v=e[i].v;
		if(v==fa)continue;
		dfs1(v,u);siz[u]++;
	}
	if(!siz[u]){f[u]=0;return;}
	for(int i=h[u];i;i=e[i].nxt)
	{
		int v=e[i].v;
		if(v==fa)continue;
		Add(f[u],1ll*inv[siz[u]]*f[v]%mod);
	}
}
void dfs2(int u,int fa)
{
	for(int i=h[u];i;i=e[i].nxt)
	{
		int v=e[i].v;
		if(v==fa)continue;
		int nowu=(1ll*(1ll*(g[u]-1+mod)*(siz[u]+(u!=1))%mod-f[v]+mod)*inv[siz[u]-(u==1)]%mod)%mod+(u!=1||siz[u]>=2);
		g[v]=(1ll*(nowu+1ll*(f[v]-1+mod)*siz[v]%mod)*inv[siz[v]+1]%mod+1)%mod;
		dfs2(v,u);
	}
}
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin>>n;inv[0]=inv[1]=1;
    for(int i=2;i<=n;i++)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
    for(int i=1;i<n;i++)
    {
    	cin>>u>>v;
    	add(u,v);add(v,u);
	}
	dfs1(1,0);g[1]=f[1];dfs2(1,0);
	for(int i=1;i<=n;i++)cout<<g[i]<<'\n';
	return 0; 
}