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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}


const ll MOD = 1e9 + 7;

struct mint {
  ll x;
  mint(ll x=0):x((x%MOD+MOD)%MOD){}
  mint& operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}
  mint& operator-=(const mint a) {if ((x += MOD-a.x) >= MOD) x -= MOD;return *this;}
  mint& operator*=(const mint a) {(x *= a.x) %= MOD;return *this;}
  mint operator+(const mint a) const {mint res(*this);return res+=a;}
  mint operator-(const mint a) const {mint res(*this);return res-=a;}
  mint operator*(const mint a) const {mint res(*this);return res*=a;}
  mint pow(ll b) const {
    mint res(1), a(*this);
    while (b) {
      if (b & 1) res *= a;
      a *= a;
      b >>= 1;
    }
    return res;
  }
  // for prime MOD
  mint inv() const {return pow(MOD-2);}
  mint& operator/=(const mint a) {return (*this) *= a.inv();}
  mint operator/(const mint a) const {mint res(*this);return res/=a;}
};
ostream& operator<<(ostream& os, const mint& a) {os << a.x; return os;}


const int MAX_N = 212345;

vector<int> g[MAX_N];

mint num_v[MAX_N];
mint way_v[MAX_N];
vector<mint> nums[MAX_N];
vector<mint> ways[MAX_N];

const int SZ = 312345;
ll inv[SZ];
ll fact[SZ];
ll fact_inv[SZ];
ll choose(int n, int r) {
  if (n < 0 || r < 0 || n < r) return 0;
  return fact[n] * fact_inv[n-r] % MOD * fact_inv[r] % MOD;
}



pair<mint, mint> dfs1(int cur, int prev) {
  nums[cur] = vector<mint>(g[cur].size());
  ways[cur] = vector<mint>(g[cur].size());

  mint num = 1, way = 1;
  REP(ci, g[cur].size()) {
    int nxt = g[cur][ci];
    if (nxt == prev) continue;
    auto child = dfs1(nxt, cur);
    nums[cur][ci] = child.first;
    ways[cur][ci] = child.second;

    num += child.first;
    way *= child.second;
  }

  way *= fact[num.x - 1];
  REP(ci, g[cur].size()) {
    int nxt = g[cur][ci];
    if (nxt == prev) continue;
    way *= fact_inv[ nums[cur][ci].x ];
  }

  num_v[cur] = num;
  way_v[cur] = way;
  return {num, way};
}

void dfs2(int cur, int prev, mint num_p, mint way_p) {

  // cout << "debug " << cur << " " << num_p << " " << way_p << endl;
  mint num = 1, way = 1;

  REP(ci, g[cur].size()) {
    int nxt = g[cur][ci];
    if (nxt == prev) {
      nums[cur][ci] = num_p;
      ways[cur][ci] = way_p;
    }
    num += nums[cur][ci];
    way *= ways[cur][ci];
    way *= fact_inv[ nums[cur][ci].x ];
  }
  way *= fact[num.x - 1];
  num_v[cur] = num;
  way_v[cur] = way;

  REP(ci, g[cur].size()) {
    int nxt = g[cur][ci];
    if (nxt == prev) continue;
    dfs2(nxt, cur,
        num - nums[cur][ci],
        way/way_v[nxt]/choose(num.x - 1, nums[cur][ci].x)
    );
  }

}

int main2() {
  REP(i, MAX_N) g[i].clear();
  int N = nextLong();
  REP(i, N-1) {
    int a = nextLong() - 1;
    int b = nextLong() - 1;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfs1(0, -1);
  dfs2(0, -1, 0, 0);

  REP(i, N)
    cout << way_v[i] << '\n';
  return 0;
}

int main() {

  inv[1] = 1;
  for (int i = 2; i < SZ; i++) inv[i] = inv[(int) (MOD % i)] * (MOD - MOD / i) % MOD;
  fact[0] = 1;
  for (int i = 1; i < SZ; i++) fact[i] = fact[i-1] * i % MOD;
  fact_inv[0] = 1;
  for (int i = 1; i < SZ; i++) fact_inv[i] = fact_inv[i-1] * inv[i] % MOD;

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}

Measured memory_bytes: 50420