#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

class TreeSize{
public:
  Int V;                        //ノード数
  Int root;                     //根
  vector<vector<Int> > G;       //Graph
  vector<Int> w;                //ノードのに重みが有る場合デフォルトでは1
  vector<Int> sz;               //部分木のサイズ
  Int ok;
  TreeSize():V(-1){};
  TreeSize(Int V,Int root = 0):V(V),root(root),G(V),w(V,1),sz(V,0),ok(0){}
  TreeSize(vector<vector<Int> > G,Int root = 0):V(G.size()),root(root),G(G),w(V,1),sz(V,0),ok(0){}
  void resize(Int n){*this = TreeSize(n);}
  Int& operator [](Int i){return w[i];}

  void add_edge(Int a,Int b){
    ok = false;
    assert(a < V && b < V);
    assert(a >= 0 && b >= 0);
    G[a].push_back(b);
    G[b].push_back(a);
  }

  void build(Int root=-1){
    ok = 1;
    if(root != -1) this->root = root;
    dfs(this->root,-1);
  }

  Int dfs(Int pos,Int pre = -1){
    sz[pos] = w[pos];
    for(Int to:G[pos]) if(to != pre) sz[pos] += dfs(to, pos);
    return sz[pos];
  }
  Int size(Int i){assert(ok);return sz[i];}
};

class Combination{
public:
  typedef long long ll;
  ll N;
  ll mod;
  vector<ll> fac;
  vector<ll> finv;
  vector<ll> inv;


  Combination(ll N = 1e6,ll mod = 1e9 + 7): N(N), mod(mod), fac(N+1), finv(N+1), inv(N+1){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(Int i = 2; i <= N; 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;
    }
  }

  function<ll(ll, ll)> mod_pow = [&](ll x, ll y){
      ll res = 1;
      while(y){
        if(y & 1) res = res * x % mod;
        x = x * x % mod;
        y >>= 1;
      }
      return res;
  };

  function<ll(ll)> inv_ = [&](ll x){return mod_pow(x, mod - 2);};

  function<ll(ll,ll)> nCr = [&](ll n,ll r){
    if( n < r ) return 0LL;
    if( n < 0 || r < 0) return 0LL;
    if(n == r || r == 0) return 1LL;
    assert(fac[r] > 0);
    assert(fac[n - r] > 0);
    return fac[n] * (finv[r] * finv[n-r] % mod) % mod;
  };

  function<ll(ll,ll)> nCr_ = [&](ll n, ll r){ //O(r + log(mod))
    if( n < r ) return 0LL;
    if( n < 0 || r < 0) return 0LL;
    if(n == r || r == 0) return 1LL;
    ll N = 1, K = 1;
    for(Int i=0;i<r;i++){
      N = N * ((n - i) % mod) % mod;
      K = K * ((r - i) % mod) % mod;
    }
    assert(K > 0);
    return N * inv_(K) % mod;
  };

  function<ll(ll, ll)> nPr=[&](ll n, ll r){
    if(n < r) return 0LL;
    if(n < 0 || r < 0) return 0LL;
    return fac[n] * finv[n - r] % mod;
  };

  //auto nCr_ = Comb.nCr_;
  //auto nPr = Comb.nPr;
  //auto fac = Comb.fac;
  //auto inv = Comb.inv
  //auto inv_ = Comb.inv_
  //auto finv = Comb.finv
};
Combination Comb;
auto nCr = Comb.nCr;


Int N;
vector<vector<Int> > G;
TreeSize ts;

Int mod_pow(Int x, Int y){
  x %= mod;
  Int res = 1;
  while(y){
    if(y & 1) res = res * x % mod;
    x = x * x % mod;
    y /= 2;
  }
  return res;
}

Int inv(Int x){return mod_pow(x, mod - 2);}


Int dfs(Int pos, Int pre){
  static Int used[200010], mem[200010];
  if(used[pos]++) return mem[pos];
  Int res = 1;
  Int num = 0;
  for(Int to:G[pos]){
    if(to == pre) continue;
    Int v = dfs(to, pos);
    Int a = num + ts.size(to);
    Int b = ts.size(to);
    res = (res * nCr(a, b) % mod) * v % mod;
    num += ts.size(to);
  }
  return mem[pos] = res;
}

vector<Int> ans;
Int dfs2(Int pos, Int pre, Int pv, Int pnum){
  Int res = 1;
  Int num = 0;
  for(Int to:G[pos]){
    if(to == pre){
      Int v = pv;
      Int a = num + pnum;
      Int b = pnum;
      res = (res * nCr(a, b) % mod) * v % mod;
      num += pnum;
    }
    else{
      Int v = dfs(to, pos);
      Int a = num + ts.size(to);
      Int b = ts.size(to);
      res = (res * nCr(a, b) % mod) * v % mod;
      num += ts.size(to);
    }
  }

  ///pr(pos, pre, pv, pnum, res, num);
  for(Int to:G[pos]){
    if(to == pre) continue;
    Int v = res;
    Int a = num;
    Int b = ts.size(to);
    v = v * inv(dfs(to, pos)) % mod;
    v = v * inv(nCr(a, b)) % mod;
    dfs2(to, pos, v, num - ts.size(to) + 1);
  }

  ans[pos] = res;
  return res;

}
signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);


  cin>>N;
  G.resize(N);
  ts.resize(N);
  for(Int i=0;i<N-1;i++){
    Int a, b;
    cin>>a>>b; a-- ,b--;
    G[a].push_back(b);
    G[b].push_back(a);
    ts.add_edge(a, b);
  }


  ans.resize(N);

  /*
  for(Int i=0;i<N;i++) {
    ts.build(i);
    pr(i, dfs(i, -1));
  }
  */

  ts.build(0);
  dfs2(0, -1, 0, 0);
  for(Int i=0;i<N;i++) cout<<ans[i]<<endl;


  return 0;
}


Measured memory_bytes: 58464