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

# define C continue;
# define R return

# define D double
# define I insert
# define ll long long
# define ld long double

# define ull unsigned long long
# define ui unsigned int

# define pb push_back
# define pf push_front

# define vi vector < int >
# define vc vector < char >
# define vs vector < string >
# define vb vector < bool >
# define vd vector < D >
# define vll vector < ll >
# define vull vector < ull >
# define vld vector < ld >
# define PQ priority_queue

# define vvi vector < vector < int > >
# define vvb vector < vector < bool > >
# define vvc vector < vector < char > >
# define vvs vector < vs >
# define vvll vector < vector < ll > >
# define vvd vector < vector < D > >
# define vvld vector < vector < ld > >

# define all(v) (v).begin() , (v).end()
# define allrev(v) (v).rbegin() , (v).rend()
# define allcomp(v) v.begin() , v.end() , comp
# define allrevcomp(v) v.rbegin() , v.rend() , comp

# define pii pair < int , int >
# define pll pair < ll , ll >
# define pld pair < ld , ld >
# define pDD pair < D , D >

# define vpld vector < pld >
# define vpii vector < pii >
# define vpll vector < pll >
# define vpDD vector < pDD >

# define vvpii vector < vector < pii > >
# define F first
# define S second
# define mp make_pair

# define dist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))

# define pp(n) printf("%.10Lf",n);
# define line cout<<"\n";
# define fast ios_base::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0);

string vow = "aeiou";
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};

const int dx[] = { -1 , 0 , 1 , 0 } ;
const int dy[] = { 0 , 1 , 0 , -1 } ;

const ld pie = 3.1415926535897932384626 ;
const ll mod = 1e9 + 7 ;

/// Tip : If a and b are positive integers ; we may say - ceil (a/b) = 1 + floor ( (a-1)/b ) .

const int N = 2e5 + 10 ;

ll f[N] ;
void pre ()
{
    f[0] = 1 ;

    for ( int i = 1 ; i < N ; i ++ )
    {
        f[i] = f[i - 1] * i ;
        f[i] %= mod ;
    }
}

ll mod_pow ( ll a , ll b )
{
    if ( b == 0 ) return 1 ;
    if ( b == 1 ) return (a%mod) ;
    if ( b == 2 ) return ((a%mod) * (a%mod)) % mod ;

    return ((mod_pow ( mod_pow ( a , b/2 ) , 2 ) * mod_pow ( a , b % 2 )) % mod) ;
}

ll mod_inv ( ll n )
{
    ll ans = mod_pow ( n , mod - 2 ) ;
    return ans ;
}

vi g[N] ;
int n , m ;

void read ()
{
    cin >> n ;

    for ( int i = 1 ; i < n ; i ++ )
    {
        int a , b ;
        cin >> a >> b ;

        a -- ; b -- ;

        g[a].pb ( b ) ;
        g[b].pb ( a ) ;
    }
}

ll sz[N] ;
ll dp[N] ;

int parent[N] ;

void init_dfs ( int node )
{
    sz[node] = 1 ;
    dp[node] = 1 ;

    for ( auto &i : g[node] )
    {
        if ( sz[i] ) C ;

        parent[i] = node ;
        init_dfs ( i ) ;

        sz[node] += sz[i] ;
    }

    if ( sz[node] == 1 ) return ;

    dp[node] *= f[sz[node] - 1] ;
    dp[node] %= mod ;

    for ( auto &i : g[node] )
    {
        if ( i == parent[node] ) C ;

        dp[node] *= dp[i] ;
        dp[node] %= mod ;

        dp[node] *= mod_inv ( f[sz[i]] ) ;
        dp[node] %= mod ;
    }
}

ll ans[N] ;
bool vis[N] ;

void dfs ( int node )
{
    vis[node] = 1 ;
    ans[node] = dp[node] ;

    for ( auto &i : g[node] )
    {
        if ( vis[i] ) C ;

        /// remove contribution from the child !

        dp[node] *= mod_inv ( dp[i] ) ;
        dp[node] %= mod ;

        dp[node] *= f[sz[i]] ;
        dp[node] %= mod ;

        dp[node] *= mod_inv ( f[sz[node] - 1] ) ;
        dp[node] %= mod ;

        dp[node] *= f[sz[node] - sz[i] - 1] ;
        dp[node] %= mod ;

        sz[node] -= sz[i] ;

        /// add contribution to the child !

        dp[i] *= dp[node] ;
        dp[i] %= mod ;

        dp[i] *= mod_inv ( f[sz[node]] ) ;
        dp[i] %= mod ;

        dp[i] *= mod_inv ( f[sz[i] - 1] ) ;
        dp[i] %= mod ;

        sz[i] += sz[node] ;

        dp[i] *= f[sz[i] - 1] ;
        dp[i] %= mod ;

        dfs ( i ) ;

        /// now revert back the changes --------->>

        /// First in 'i' !

        dp[i] *= mod_inv ( f[sz[i] - 1] ) ;
        dp[i] %= mod ;

        sz[i] -= sz[node] ;

        dp[i] *= f[sz[i] - 1] ;
        dp[i] %= mod ;

        dp[i] *= f[sz[node]] ;
        dp[i] %= mod ;

        dp[i] *= mod_inv ( dp[node] ) ;
        dp[i] %= mod ;

        /// revert back changes in the 'node'

        sz[node] += sz[i] ;

        dp[node] *= mod_inv ( f[sz[node] - sz[i] - 1] ) ;
        dp[node] %= mod ;

        dp[node] *= ( f[sz[node] - 1] ) ;
        dp[node] %= mod ;

        dp[node] *= mod_inv ( f[sz[i]] ) ;
        dp[node] %= mod ;

        dp[node] *= ( dp[i] ) ;
        dp[node] %= mod ;
    }
}

void solve ( int test_case )
{
    read () ;
    init_dfs ( 0 ) ;

//    cout << "DP values : " ;
//    for ( int i=0 ; i < n ; i ++ )
//        cout << dp[i] << " " ;
//
//    line ;

    dfs ( 0 ) ;
    for ( int i=0 ; i < n ; i ++ )
        cout << ans[i] << " " ;

    line ;
}

int main()
{fast
    pre () ;
    int t = 1;
    // cin >> t;

    for ( int i=1 ; i <= t ; i ++ ) solve ( i ) ;
    return 0;
}


Measured memory_bytes: 21108