#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

class Modulo{
  private:
    ll MAX = MOD;
    vll fac_v, finv_v, inv_v;
  public:

    void Modulo_setting(ll MAX_){
      MAX = MAX_;

      fac_v.resize(MAX+1);
      finv_v.resize(MAX+1);
      inv_v.resize(MAX+1);

      fac_v[0] = fac_v[1] = 1;
      finv_v[0] = finv_v[1] = 1;
      inv_v[1] = 1;
      for(int i=2; i<=MAX; ++i){
        //i!
        fac_v[i] = (fac_v[i-1]*i)%MOD;
        //i^{-1}
        inv_v[i] = (MOD-(inv_v[MOD%i]*(MOD/i))%MOD)%MOD;
        //(i!)^{-1}
        finv_v[i] = (finv_v[i-1]*inv_v[i])%MOD;
      }
    };

    Modulo(ll MAX_){
      Modulo_setting(MAX_);
      return;
    };

    Modulo(void){
      Modulo_setting(MOD);
      return;
    };

    ~Modulo(void){
      return;
    };

    ll inv(ll n){
      if(n<0 || n>MAX){
        fprintf(stderr, "n range error\n");
        exit(0);
      }
      return inv_v[n];
    };

    ll fac(ll n){
      if(n<0 || n>MAX){
        fprintf(stderr, "n range error\n");
        exit(0);
      }
      return fac_v[n];
    };

    ll inv_fac(ll n){
      if(n<0 || n>MAX){
        fprintf(stderr, "n range error\n");
        exit(0);
      }
      return finv_v[n];
    };

    ll ModCom(ll n, ll k){
      if(n<k) return 0;
      if(n<0 || k<0 || n-k<0) return 0;
      return (fac_v[n]*((finv_v[k]*finv_v[n-k])%MOD))%MOD;
    };

    ll ExCom(ll n, ll k){
      if(n<k) return 0;
      if(n<0 || k<0) return 0;
      ll ans = 1;
      k = min(k, n-k);
      for(ll i=0; i<k; ++i){
        ans *= (n-i);
        ans /= (i+1);
      }
      return ans;
    };

    ll pow(ll x, ll n){
      ll res=1;
      while(n>0){
        if(n&1) res=res*x%MOD;
        x=x*x%MOD;
        n>>=1;
      }
      return res;
    };

    unordered_map<ll, ll> prime_decomposer(ll n){
      unordered_map<ll, ll> mp;
      for(ll i=2; i*i<=n; ++i){
        while(n%i==0){
          mp[i]++;
          n/=i;
        }
      }
      if(n!=1) mp[n]++;
      return mp;
    };

    ll LCM(vector<ll> vec){
      unordered_map<ll, ll> mp;
      for(ll i=0; i<vec.size(); ++i){
        unordered_map<ll, ll> mp_tmp = prime_decomposer(vec[i]);
        for(auto e : mp_tmp){
          mp[e.first] = max(mp[e.first], e.second);
        }
      }
      ll lcm=1;
      for(auto e : mp){
        lcm = (lcm*pow(e.first, e.second))%MOD;
      }
      return lcm;
    };

    ll GCM(vector<ll> vec){
      unordered_map<ll, ll> mp;
      for(ll i=0; i<vec.size(); ++i){
        unordered_map<ll, ll> mp_tmp = prime_decomposer(vec[i]);
        for(auto e : mp_tmp){
          if(mp.find(e.first)==mp.end()) mp[e.first] = e.second;
          else mp[e.first] = min(mp[e.first], e.second);
        }
      }
      ll gcm=1;
      for(auto e : mp){
        gcm = (gcm*pow(e.first, e.second))%MOD;
      }
      return gcm;
    };
};



template< typename Data, typename T > // Data: the datatype of a data on each bond, T: the datatype of the data that each node has
class ReRooting{
  private:
    struct Edge { // g[u][i].to = j <=> g[j][g[u][i].rev] = u
      ll to, rev;
      Data data;
    };

    using F1 = function< T(T, T) >; // the function to compare two data that each node has
    using F2 = function< T(T, Data) >; // the function to obtain the data on child node through the bond
   
    ll N;
    vector<vector<Edge> > g;
    vector<vector<T> > ldp, rdp;
    vll lptr, rptr;
    const F1 f1;
    const F2 f2;

    T dfs(ll idx, ll par) {
      while(lptr[idx]!=par && lptr[idx]<g[idx].size()) {
        auto &e = g[idx][lptr[idx]];
        ldp[idx][lptr[idx]+1] = f1(ldp[idx][lptr[idx]], f2(dfs(e.to, e.rev), e.data));
        ++lptr[idx];
      }
      while(rptr[idx]!=par && rptr[idx]>=0) {
        auto &e = g[idx][rptr[idx]];
        rdp[idx][rptr[idx]] = f1(rdp[idx][rptr[idx]+1], f2(dfs(e.to, e.rev), e.data));
        --rptr[idx];
      }
      if(par<0) return rdp[idx][0];
      return f1(ldp[idx][par], rdp[idx][par+1]);
    };

  public:
   
    ReRooting(ll n, const F1 &f1, const F2 &f2) :
        N(n), g(n), ldp(n), rdp(n), lptr(n), rptr(n), f1(f1), f2(f2) {return;};

    ~ReRooting(void) {return;};
   
    void add_edge(ll u, ll v, const Data &d) {
      g[u].emplace_back((Edge) {v, (ll) g[v].size(), d});
      g[v].emplace_back((Edge) {u, (ll) g[u].size() - 1, d});
    };
   
    void add_edge_bi(ll u, ll v, const Data &d, const Data &e) {
      g[u].emplace_back((Edge) {v, (ll) g[v].size(), d});
      g[v].emplace_back((Edge) {u, (ll) g[u].size() - 1, e});
    };
   
    vector<T> solve(T init) {
      for(ll i=0; i<N; ++i){
        ldp[i].assign(g[i].size()+1, init);
        rdp[i].assign(g[i].size()+1, init);
        lptr[i] = 0;
        rptr[i] = (ll)g[i].size()-1;
      }
      vector<T> ret(N);
      for(ll i=0; i<N; ++i){
        ret[i] = dfs(i, -1);
      }
      return ret;
    };

    vector<T> solve(vector<T> init){
      for(ll i=0; i<N; ++i){
        ldp[i].assign(g[i].size()+1, init[i]);
        rdp[i].assign(g[i].size()+1, init[i]);
        lptr[i] = 0;
        rptr[i] = (ll)g[i].size()-1;
      }
      vector<T> ret(N);
      for(ll i=0; i<N; ++i){
        ret[i] = dfs(i, -1);
      }
      return ret;
    };
};

Modulo que(1E6+7);

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N;
  IN(N);
  pll init(1, 0);

  auto f1 = [](pll a, pll b){
    pll tmp;
    tmp.first = a.first * b.first;
    tmp.first %= MOD;
    tmp.second = a.second + b.second;
    return tmp;
  };

  auto f2 = [](pll a, ll b){
    a.first *= que.fac(a.second);
    a.first %= MOD;
    a.second += b;
    a.first *= que.inv_fac(a.second);
    a.first %= MOD;
    return a;
  };

  ReRooting<ll, pll> g(N, f1, f2);

  REP(i,N-1){
    ll a, b;
    IN(a,b);
    a--; b--;
    g.add_edge(a, b, 1);
  }
  
  for(auto &p : g.solve(init)){
    ll first = p.first;
    ll second = p.second;
    OUT((que.fac(second)*first)%MOD);
  }


  return 0;
}

Measured memory_bytes: 84992