#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<60;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
ll gya[1000010];
ll kai[1000010];
void nckinit(ll n,ll md){
  kai[0]=1;
  kai[1]=1;
  for(int i=2;i<=n;i++){
    kai[i]=kai[i-1]*i;
    kai[i]%=md;
  }
  gya[n]=gyaku(kai[n],md);
  for(int i=n-1;i>=1;i--){
    gya[i]=gya[i+1]*(i+1);
    gya[i]%=md;
  }
  gya[0]=1;
}
ll nck(ll n,ll k,ll md){
  if(k<0)return 0;
  if(k==0||n==k)return 1;
  ll ret=kai[n];
  ret*=gya[n-k];
  ret%=md;
  ret*=gya[k];
  ret%=md;
  return ret;
}
ll npk(ll n,ll k,ll md){
  if(k<0)return 0;
  if(k==0)return 1;
  ll ret=kai[n];
  ret*=gya[n-k];
  ret%=md;
  return ret;
}
vector<int> v[200001];
ll dp[200001];
ll tyou[200001];
ll ans[200001];
void dfs1(int now,int par){
    ll ka=1,tyo=0,kota=1;
    rep(i,0,v[now].size()){
        int ne=v[now][i];
        if(ne==par)continue;
        dfs1(ne,now);
        tyo+=tyou[ne];
        (ka*=kai[tyou[ne]])%=mod;
        (kota*=dp[ne])%=mod;
    }
    (kota*=kai[tyo])%=mod;
    (kota*=gyaku(ka,mod))%=mod;
    dp[now]=kota;
    tyou[now]=tyo+1;
}
void dfs2(int now,ll pako,ll patyo,int par){
    ll ka=1,tyo=0,kota=1;
    rep(i,0,v[now].size()){
        int ne=v[now][i];
        if(ne==par){
            tyo+=patyo;
            (kota*=pako)%=mod;
            (ka*=kai[patyo])%=mod;
        }
        else{
            tyo+=tyou[ne];
            (kota*=dp[ne])%=mod;
            (ka*=kai[tyou[ne]])%=mod;
        }
    }
    ans[now]=kota*kai[tyo]%mod;
    (ans[now]*=gyaku(ka,mod))%=mod;
    rep(i,0,v[now].size()){
        int ne=v[now][i];
        if(ne==par)continue;
        ll ntyo=tyo-tyou[ne];
        ll nka=ka*gyaku(kai[tyou[ne]],mod)%mod;
        ll nkota=kota*gyaku(dp[ne],mod)%mod;
        (nkota*=kai[ntyo])%=mod;
        (nkota*=gyaku(nka,mod))%=mod;
        dfs2(ne,nkota,ntyo+1,now);
    }
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int n;cin>>n;
    rep(i,0,n-1){
        int a,b;cin>>a>>b;
        a--;
        b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    nckinit(n+1,mod);
    dfs1(0,-1);
    dfs2(0,1,0,-1);
    rep(i,0,n)cout<<ans[i]<<endl;
}





Measured memory_bytes: 25588