#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
const int mod = 1000000007;
const int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  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 { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // 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 { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
}comb(max_n);

vvl g;
vl sz,order,parent;
ll szdfs(ll v,ll par=-1){
    if(sz[v]!=0)return sz[v];
    ll res=1;
    for(auto nv:g[v]){
        if(nv==par)continue;
        res+=szdfs(nv,v);
    }
    sz[v]=res;
    order.pb(v);
    parent.pb(par);
    return res;
}
vector<mint> dp(max_n,0);
void dfs(ll v,ll par=-1){
    mint res=comb.fact[sz[v]-1];
    for(auto nv:g[v]){
        if(nv==par)continue;
        dfs(nv,v);
        res*=dp[nv];
        res*=comb.ifact[sz[nv]];
    }
    dp[v]=res;
    return;
}
int main(){
    ll n;cin >> n;g.resize(n);
    rep(i,n-1){
        ll a,b;cin >> a >>b;a--;b--;
        g[a].pb(b);g[b].pb(a);
    }
    sz.resize(n);
    szdfs(0);
    dfs(0);
    vector<mint> dp2(n);
    dp2[0]=dp[0];
    rev(all(order));rev(all(parent));
    rep(i,n){
        if(i==0)continue;
        ll e=order[i],p=parent[i];
        mint red=dp2[p]*comb.fact[n-1-sz[e]]*comb.fact[sz[e]];
        dp2[e]=red*comb.ifact[sz[e]-1]*comb.ifact[n-sz[e]];
    }
    //rep(i,n)cout << dp[i] << endl;
    rep(i,n)cout << dp2[i] << endl;
}

Measured memory_bytes: 28016