//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) for(ll i=a;i<(ll)(n);++i)
#define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i)
#define ENDL '\n'
typedef pair<int,int> Pi;
typedef pair<ll,ll> PL;
constexpr ll mod = 1000000007;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 +99);
const vector<ll> dx={-1,1,0,0},dy={0,0,-1,1};
template<typename T,typename U> inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;}
template<typename T,typename U> inline bool chmax(T& t, const U& u){if(t<u){t=u;return 1;}return 0;}
template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T,typename Y> inline T mpow(T a, Y n) {
  T res = 1;  
  for(;n;n>>=1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}

const int MAX = 200010;//設定して

long long fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod%i] * (mod / i) % mod;//＊１
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

long long modpow(long long a, long long n, long long MOD) {//a^n(MOD)を求める
    long long res = 1%MOD;
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;//次の準備
        n >>= 1;
    }
    return res;
}


ll get_inv(ll x){
  return modpow(x,mod-2,mod);
}


ll n;
VV<int> e;
ll dp[200010]={};
ll vnum[200010]={};

ll ans[200010]={};


ll dfs1(int now,int pre){
  ll res=1,coe=1,tmp;
  for(auto&& nex:e[now]){
    if(nex==pre)continue;

    tmp=dfs1(nex,now);

    vnum[now]+=1+vnum[nex];

    res*=tmp;
    res%=mod;

    coe*=finv[vnum[nex]+1];
    coe%=mod;
  }

  if(vnum[now]>0){
    dp[now]=res*fac[vnum[now]];
    dp[now]%=mod;
    dp[now]*=coe;
    dp[now]%=mod;
  }else{
    dp[now]=1;
  }

  return dp[now];
}


void dfs2(int now,int pre){
  ans[now]=1;

  if(pre==-1)ans[now]=dp[now];
  else{
    for(auto&& nex:e[now]){
      if(nex==pre){
        ll tmp=ans[pre];
        tmp*=get_inv(dp[now]);
        tmp%=mod;

        tmp*=fac[n-1-vnum[now]-1];
        tmp%=mod;
        tmp*=finv[n-1];
        tmp%=mod;

        tmp*=fac[vnum[now]+1];
        tmp%=mod;

        ans[now]*=tmp;
        ans[now]%=mod;
        ans[now]*=finv[n-(vnum[now]+1)];
        ans[now]%=mod;
      }else{
        ans[now]*=dp[nex];
        ans[now]%=mod;
        ans[now]*=finv[vnum[nex]+1];
        ans[now]%=mod;
      }
    }
    ans[now]*=fac[n-1];
    ans[now]%=mod;
  }
  

  for(auto&& nex:e[now]){
    if(nex==pre)continue;
    dfs2(nex,now);
  }
}

signed main(){
  cin.tie(0);ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(20);
  COMinit();

  cin>>n;
  e.assign(n,V<int>(0));

  rep(i,0,n-1){
    int a,b;cin>>a>>b;
    a--;b--;
    e[a].pb(b);
    e[b].pb(a);
  }

  dfs1(0,-1);
  dfs2(0,-1);

  rep(i,0,n){
    cerr<<dp[i]<<" ";
    cout<<ans[i]<<ENDL;
  }
}
//! ( . _ . ) ! 
//CHECK overflow,vector_size,what to output?

Measured memory_bytes: 23708