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

#define LL long long
typedef pair<int, int> pii;

template< typename T > inline void read(T &x)
{
    static char _c;
    static bool _f;

    x = 0;
    _f = 0;
    _c = getchar();

    while(_c < '0' || '9' < _c) {if(_c == '-') _f = true; _c = getchar();}
    while('0' <= _c && _c <= '9') {x = (x << 1) + (x << 3) + (_c & 15); _c = getchar();}
    if(_f) x = -x;
}

template < typename T > inline void Min(T &x, T y) {if(y < x) x = y;}
template < typename T > inline void Max(T &x, T y) {if(x < y) x = y;}


#define lowbit(x) ((x) & -(x))
#define lson l,mid,id<<1
#define rson mid+1,r,id<<1|1
#define ls id<<1
#define rs id<<1|1
#define MID(l,r) ((l)+(((r)-(l))>>1))
#define fi first
#define se second
#define mk make_pair
#define pb push_back

const int INF = 0x3f3f3f3f;
const double pi = (double) acos(-1.0);
const double eps = (double) 1e-8;
const int MOD = (int) 1e9 + 7;
//const int MOD = (int) 998244353;
const int maxn = (int) 2e5 + 20;
const int maxm = (int) 1e6 + 20;

inline int sig(double x) {return x < -eps ? -1 : eps < x;}
LL fp(LL a, LL n, LL MOD)
{
    if(n < 0) a = fp(a, MOD - 2, MOD), n = -n;
    LL res = 1; for(; n; n >>= 1, a = a * a % MOD) if(n & 1) res = res * a % MOD; return res;
}

int n;
vector<int> G[maxn];
LL po[maxn];
LL inv[maxn];


LL sz[maxn];
LL dp[maxn];
LL ans[maxn];

void dfs(int u, int f)
{
    dp[u] = 1;
    sz[u] = 0;
    for(auto v : G[u])
    {
        if(v == f) continue;
        dfs(v, u);
        dp[u] = dp[u] * dp[v] % MOD * po[sz[u] + sz[v]] % MOD * inv[sz[v]] % MOD * inv[sz[u]] % MOD;
        sz[u] += sz[v];

    }
    sz[u]++;
}

LL calc_dp(LL dp, LL dp2, LL sz, LL sz2)
{
    return dp * dp2 % MOD * po[sz + sz2] % MOD * inv[sz] % MOD * inv[sz2] % MOD;
}

void dfs2(int u, int f, LL dpt, LL szt)
{
    ans[u] = dp[u] * dpt % MOD * po[szt + sz[u] - 1] % MOD * inv[szt] % MOD * inv[sz[u] - 1] % MOD;

    vector<LL> cnt_dp(G[u].size() + 2);
    vector<LL> cnt_sz(G[u].size() + 2);
    vector<LL> rev_dp(G[u].size() + 2);
    vector<LL> rev_sz(G[u].size() + 2);

    cnt_dp[0] = 1;
    cnt_sz[0] = 0;

    for(int i = 0; i < G[u].size(); i++)
    {
        int v = G[u][i];
        if(v == f)
        {
            cnt_dp[i + 1] = cnt_dp[i];
            cnt_sz[i + 1] = cnt_sz[i];
            continue;
        }

        cnt_dp[i + 1] = calc_dp(cnt_dp[i], dp[v], cnt_sz[i], sz[v]);
        cnt_sz[i + 1] = cnt_sz[i] + sz[v];
    }

    rev_dp[G[u].size() + 1] = 1;
    rev_sz[G[u].size() + 1] = 0;

    for(int i = G[u].size() - 1; i >= 0; i--)
    {
        int v = G[u][i];
        if(v == f)
        {
            rev_dp[i + 1] = rev_dp[i + 2];
            rev_sz[i + 1] = rev_sz[i + 2];
            continue;
        }

        rev_dp[i + 1] = calc_dp(rev_dp[i + 2], dp[v], rev_sz[i + 2], sz[v]);
        rev_sz[i + 1] = rev_sz[i + 2] + sz[v];
    }

    for(int i = 0; i < G[u].size(); i++)
    {
        int v = G[u][i];
        if(v == f) continue;

        LL tmp_dp, tmp_sz;
        tmp_dp = calc_dp(cnt_dp[i], rev_dp[i + 2], cnt_sz[i], rev_sz[i + 2]);
        tmp_sz = cnt_sz[i] + rev_sz[i + 2];

        dfs2(v, u, calc_dp(dpt, tmp_dp, szt, tmp_sz), szt + tmp_sz + 1);
    }
}

void work()
{
    cin >>n;
    po[0] = 1;
    for(int i = 1; i <= n; i++) po[i] = po[i - 1] * i % MOD;
    inv[n] = fp(po[n], -1, MOD);
    for(int i = n - 1; i >= 0; i--) inv[i] =  inv[i + 1] * (i + 1) % MOD;

    for(int i = 1 ; i < n; i++)
    {
        int x, y;
        read(x), read(y);
        G[x].pb(y);
        G[y].pb(x);
    }

    dfs(1, 1);
    dfs2(1, 1, 1, 0);


    for(int i = 1; i <= n; i++) cout <<ans[i] <<endl;
}



int main(int argc, char **argv)
{
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif // yukihana0416
//    get_prime();
//    pre();
    int tc = 1;
//    read(tc);
    for(int ca = 1; ca <= tc; ca++)
    {
//        printf("Case #%d: ", ca);
        work();
    }
    return 0;
}


Measured memory_bytes: 28416