#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <cassert>
using namespace std;
#define fast_io ios_base::sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define MOD (long long int)(1e9+7)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  if(n <= 1e7){
    ret *= kaijo(n); ret %= MOD;
    ret *= gyaku_kaijo(r); ret %= MOD;
    ret *= gyaku_kaijo(n-r); ret %= MOD;
  }else{
    rep(i,r){
      ret *= n-i; ret %= MOD;
      ret *= mpow(r-i, MOD-2); ret %= MOD;
    }
  }
  return ret;
}

// (size-1)! * Pi(dp / size!)
vector<int> G[(int)2e5+3];
vector<int> child[(int)2e5+3];
vector<ll> size[(int)2e5+3], dp[(int)2e5+3];

Pll saiki(int now, int parent){
  ll mul = 1, sum = 0;
  rep(j, G[now].size()){
    int next = G[now][j];
    if(next == parent) continue;
    child[now].push_back(next);

    Pll p = saiki(next, now);

    size[now].push_back(p.first);
    sum += size[now].back();
    
    dp[now].push_back(p.second % MOD);
    mul *= dp[now].back();
    mul %= MOD;
    mul *= gyaku_kaijo(size[now].back());
    mul %= MOD;
  }
  return {sum + 1, kaijo(sum) * mul % MOD};
}

void saiki2(int now, int parent){
  vector<ll> Ls, Rs, Ld, Rd;
  Ls.push_back(0);
  Rs.push_back(0);
  Ld.push_back(1);
  Rd.push_back(1);

  rep(j, child[now].size()){
    Ls.push_back(Ls.back() + size[now][j]);
    Ld.push_back(Ld.back() * dp[now][j] % MOD * gyaku_kaijo(size[now][j]) % MOD);
  }

  REP(j, child[now].size()){
    Rs.push_back(Rs.back() + size[now][j]);
    Rd.push_back(Rd.back() * dp[now][j] % MOD * gyaku_kaijo(size[now][j]) % MOD);
  }

  reverse(all(Rs));
  reverse(all(Rd));

  rep(j, child[now].size()){
    int next = child[now][j];
    if(next == parent) continue;
    child[next].push_back(now);

    size[next].push_back(Ls[j] + Rs[j+1] + 1);
    dp[next].push_back(kaijo(size[next].back() - 1) * Ld[j] % MOD * Rd[j+1] % MOD);
    //cout<<now<<" "<<parent<<" "<<child[now][j]<<" "<<size[next].back()<<" "<<dp[next].back()<<endl;
    saiki2(next, now);
  }
}

int main(void){
  fast_io
  cout<<fixed<<setprecision(15);

  int n;cin>>n;
  rep(i,n-1){
    int a,b;cin>>a>>b;a--;b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  saiki(min(n-1, 0), -1);
  saiki2(min(n-1, 0), -1);
  rep(i,n){
    ll sum = 1, mul = 1;
    rep(j,G[i].size()){
      sum += size[i][j];
      mul *= dp[i][j];
      mul %= MOD;
      mul *= gyaku_kaijo(size[i][j]);
      mul %= MOD;
    }
    cout<<kaijo(sum-1) * mul % MOD<<endl;
  }
}


Measured memory_bytes: 59500