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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)
#define ABS(x) max((x),-(x))

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
inline ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

inline ll ADD(ll x, ll y) { return (x+y) % MOD; }
inline ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
inline ll MUL(ll x, ll y) { return x*y % MOD; }
inline ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
inline ll INV(ll y) { /*assert(y%MOD!=0);*/ return POW(y, MOD-2); }
inline ll DIV(ll x, ll y) { return MUL(x, INV(y)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

void horizontal(vector<int>& v) {
    int L = v.size();
    for (int i=0; i<L; ++i) {
        printf("%d%c", v[i], (i==L-1)?'\n':' ');
    }
}
void horizontall(vector<long long>& v) {
    int L = v.size();
    for (int i=0; i<L; ++i) {
        printf("%lld%c", v[i], (i==L-1)?'\n':' ');
    }
}



using P = pair<int,int>;

struct solution {
    vvi nxt;
    vector<int> deg, pi;
    vector<vector<P>> dp;
    vector<P> ans;

    solution(int N, vi& a, vi& b) : nxt(N), deg(N), pi(N), dp(N), ans(N) {
        rep(i,N-1){
            nxt[a[i]].pb(b[i]);
            nxt[b[i]].pb(a[i]);
        }

        prepare_fact(N*2);

        dfs(0);
        bfs(0);
    };

    vll fact, ifact;
    void prepare_fact(int nmax){
        fact.resize(nmax+1);
        ifact.resize(nmax+1);
        fact[0] = ifact[0] = 1;
        fact[1] = 1;
        for (int i=2; i<=nmax; ++i){
            fact[i] = MUL(fact[i-1], i);
        }
        ifact[nmax] = INV(fact[nmax]);
        for (int i=nmax; i>=2; --i){
            ifact[i-1] = MUL(ifact[i], i);
        }
        assert(ifact[1] == 1);
    }
    ll nCr(int n, int r){
        return MUL(fact[n], MUL(ifact[n-r], ifact[r]));
    }
    ll nHr(int a, int b){
        return MUL(fact[a+b], MUL(ifact[a], ifact[b]));
    }

    P f(P& x, P& y){
        int xn=x.first, yn=y.first;
        int xp=x.second, yp=y.second;
        ll p = MUL(MUL(xp, yp), nHr(xn, yn));
        P res(xn+yn, (int)p);
        return res;
    }

    P dfs(int u, int p=-1){
        deg[u] = (int)nxt[u].size();
        P res(0,1);
        dp[u].assign(deg[u], P(0,1));
        rep(i, deg[u]){
            int v = nxt[u][i];
            if (v == p){
                pi[u] = i;
                continue;
            }
            dp[u][i] = dfs(v, u);
            res = f(res, dp[u][i]);
        }
        ++res.first;
        return res;
    }

    void bfs(int u, P res_p=P(0,1), int p=-1){
        if (p != -1) {
            dp[u][pi[u]] = res_p;
        }
        vector<P> dpl(deg[u]+1, P(0,1)), dpr(deg[u]+1, P(0,1));
        rep(i, deg[u]){
            dpl[i+1] = f(dpl[i], dp[u][i]);
        }
        for(int i=deg[u]-1; i>=0; --i){
            dpr[i] = f(dpr[i+1], dp[u][i]);
        }
        assert(dpr[0] == dpl[deg[u]]);
        ans[u] = dpr[0];
        rep(i, deg[u]){
            int v = nxt[u][i];
            if (v == p) continue;
            P px = f(dpl[i], dpr[i+1]);
            ++px.first;
            bfs(v, px, u);
        }
    }
};

int main() {
    int N; scanf("%d%*c", &N);
    vi a(N-1),b(N-1);
    rep(i,N-1){
        scanf("%d %d%*c", &a[i], &b[i]);
        --a[i]; --b[i];
    }
    solution s(N,a,b);
    rep(i,N){
        printf("%d\n", s.ans[i].second);
    }
    return 0;
}


Measured memory_bytes: 38516