#include <bits/stdc++.h>
 
#define FOR(i, a, b) for(auto i=a; i<=b; ++i)
#define REP(i, a, b) for(auto i=a; i<b; ++i)
#define FORI(i, a, b) for(auto i=a; i!=b+1-2*(a>b); i+=1-2*(a>b))
#define REPI(i, a, b) for(auto i=a-(a>b); i!=b-(a>b); i+=1-2*(a>b))
#define ALL(v) v.begin(),v.end()
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define eb(a, b) emplace_back(a, b)
#define fir first
#define sec second
#define what_is(x) cout<<#x<<" is "<<x<<endl;
#define type(x) typeid(x).name()
#define ms(arr, val) memset(arr, val, sizeof(arr))
#define min3(a,b,c) min(min(a,b),c)
#define max3(a,b,c) max(max(a,b),c)
#define PI acos(-1)
#define open_read freopen("christmas.in", "r", stdin)
#define open_write freopen("christmas.out", "w", stdout)
 
using namespace std;
 
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<double, double> PDD;
typedef pair<int, int> PII;
typedef pair<int, PII> PIPII;
typedef pair<PII, PII> PPIIPII;
typedef pair<LL, LL> PLL;
typedef pair<ULL, ULL> PUU;
typedef pair<LL, PLL> PLPLL;
typedef pair<PLL, PLL> PPLLPLL;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
 
template<typename T, typename T1>
ostream& operator << (ostream &out, pair<T, T1> obj) {
    out << "(" << obj.first << ", " << obj.second << ")";
    return out;
}
 
template<typename T, typename T1>
ostream& operator << (ostream &out, map<T, T1> cont) {
    typename map<T, T1>::const_iterator itr = cont.begin();
    typename map<T, T1>::const_iterator ends = cont.end();
 
    for(; itr != ends; ++itr) {
        out << *itr << " ";
    }
 
    out<<endl;
    return out;
} 

template<typename T>
ostream& operator << (ostream &out, set<T> cont) {
    typename set<T>::const_iterator itr = cont.begin();
    typename set<T>::const_iterator ends = cont.end();
    
    for(; itr != ends; ++itr) {
        out << *itr << " ";
    }
 
    out << endl;
    return out;
}
  
template<typename T>
ostream& operator << (ostream &out, multiset<T> cont) {
    typename multiset<T>::const_iterator itr = cont.begin();
    typename multiset<T>::const_iterator ends = cont.end();
 
    for (; itr != ends; ++itr) {
        out << *itr << " ";
    }
 
    out << endl;
    return out;
}

template<typename T, template<typename ELEM, typename ALLOC=allocator<ELEM>> class CONT>
ostream& operator << (ostream &out, CONT<T> cont) {
    typename CONT<T>::const_iterator itr = cont.begin();
    typename CONT<T>::const_iterator ends = cont.end();
 
    for (; itr != ends; ++itr) {
        out << *itr << " ";
    }
 
    out << endl;
    return out;
}
 
template<typename T, unsigned int N, typename CTy, typename CTr>
typename enable_if<!is_same<T, char>::value, basic_ostream<CTy, CTr> &>::type
operator << (basic_ostream<CTy, CTr> &out, const T (&arr)[N]) {
    REP (i, 0, N) {
        out << arr[i] << " ";
    }
 
    out << endl;
    return out;
}
  
template<typename T>
T GCD(T a, T b) {
    T min_v = min(a, b);
    T max_v = max(a, b);
 
    while (min_v) {
        T temp = max_v % min_v;
        max_v = min_v;
        min_v = temp;
    }
 
    return max_v;
}
 
template<typename T>
T LCM(T a, T b) {
    return (a * b) / gcd(a, b);
}
 
template<typename T>
T fastExpPow(T base, T exp, T mod) {
    T res = 1;
 
    while (exp) {
        if (exp & 1) {
            res *= base;
            res %= mod;
        }
 
        exp >>= 1;
        base *= base;
        base %= mod;
    }
 
    return res % mod;
}
 
/*#################################################################################################################
###################################################################################################################
###################################################################################################################
#################################################################################################################*/

#define SIZE 200010
#define MOD 1000000007LL

int N;
vector<int> tree[SIZE];
LL sub_tree[SIZE], ways[SIZE], factorial[SIZE], result[SIZE];


LL binomial(LL a, LL b) {
    LL nom = factorial[a];
    LL denom = (fastExpPow(factorial[b], MOD - 2LL, MOD) * fastExpPow(factorial[a - b], MOD - 2LL, MOD)) % MOD;

    return (nom * denom) % MOD;
}

void dfs(int node = 1, int par = 0) {
    sub_tree[node] = 1;

    for (auto conn_node: tree[node]) {
        if (conn_node != par) {
            dfs(conn_node, node);
            
            sub_tree[node] += sub_tree[conn_node];
            ways[node] = (ways[node] * ways[conn_node]) % MOD; 
        }
    }
    
    LL value = sub_tree[node] - 1;
    
    for (auto conn_node: tree[node]) {
        if (conn_node != par) {
            ways[node] = (ways[node] * binomial(value, sub_tree[conn_node])) % MOD;
            value -= sub_tree[conn_node];
        }
    }
}

void solve(int node = 1, int par = 0) {
    result[node] = ways[node];

    for (auto conn_node: tree[node]) {
        if (conn_node != par) {
            LL temp1 = sub_tree[node], temp2 = ways[node];
            LL temp3 = sub_tree[conn_node], temp4 = ways[conn_node];
            
            sub_tree[node] -= sub_tree[conn_node];
            sub_tree[conn_node] = N;

            LL v1 = (ways[conn_node] * binomial((LL)N - 1LL, temp3)) % MOD;
            LL v2 = fastExpPow(v1, MOD - 2LL, MOD);
            ways[node] = (ways[node] * v2) % MOD;
            
            v2 = (ways[node] * binomial((LL)N - 1LL, sub_tree[node]) % MOD);
            ways[conn_node] = (ways[conn_node] * v2) % MOD;

            solve(conn_node, node);

            sub_tree[node] = temp1, ways[node] = temp2;
            sub_tree[conn_node] = temp3, ways[conn_node] = temp4;
        }
    }
    
}


int main() {
    scanf("%d", &N);
    factorial[0] = 1;

    FOR (i, 1, N) {
        factorial[i] = (factorial[i - 1] * (LL)i) % MOD;
        ways[i] = 1;
    }

    FOR (i, 1, N - 1) {
        int U, V;
        scanf("%d%d", &U, &V);
        
        tree[U].pb(V);
        tree[V].pb(U);
    }
    
    dfs();
    solve();

    FOR (i, 1, N) {
        printf("%lld\n", result[i]);
    }

    return 0;
}   


Measured memory_bytes: 21292