#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 998244353
int read(){
	int 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<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*f;
}
int qp(int a,int b){
	if(!b)return 1;
	if(b&1)return qp(a,b-1)*a%mod;
	int t=qp(a,b>>1);
	return t*t%mod;
}
int n,u,v,dp[200005],inv[200005],cnt[200005];
vector<int>E[200005];
void dfs1(int p,int fa=0){
	for(auto &&v:E[p])
		if(v!=fa){
			dfs1(v,p);
			dp[p]=(dp[p]+dp[v])%mod,cnt[p]++;
		}
	dp[p]=(dp[p]*inv[cnt[p]]%mod+1)%mod;
}
void dfs2(int p,int fa=0){
	int idx=0,sum;
	for(auto v:E[p])
		if(v!=fa){
			sum=(((dp[p]-1+mod)%mod*(cnt[p]+(p>1))%mod-dp[v]+mod)%mod*inv[cnt[p]-(p==1)]+1)%mod;
			dp[v]=(((dp[v]-1+mod)%mod*cnt[v]%mod+sum)*inv[cnt[v]+1]%mod+1)%mod;
			dfs2(v,p),idx++;
		}
}
signed main(){
	n=read(),inv[0]=1;
	for(int i=1;i<=n;i++)inv[i]=qp(i,mod-2);
	for(int i=1;i<n;i++){
		u=read(),v=read();
		E[u].push_back(v);
		E[v].push_back(u);
	}
	dfs1(1),dfs2(1);
	for(int i=1;i<=n;i++)printf("%lld\n",(dp[i]+mod-1)%mod);
	return 0;
}