#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>   
using namespace std;
using namespace __gnu_pbds;
typedef long long ll; 
#define int long long
typedef unsigned long long lu;
typedef vector<ll> v;
typedef vector<vector<ll> > vv;
typedef vector<string>  vs;
typedef vector<pair<ll,ll>> vpr;
typedef long double ld;
#define f(i,n) for(ll i = 0; i < n; i++)
#define ff(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define endl "\n"
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define amax(x,y) if(y>x) x=y;
#define amin(x,y) if(y<x)x=y;
#define bg(x) x.begin()
#define sz(x) (ll)x.size()
#define in(x,n) for(ll i=0;i<n;i++)cin>>x[i]
#define out(x,n) for(ll i=0;i<n;i++)cout<<x[i]<<" " 
#define mxt(a) *(max_element(a.begin(),a.end()))
#define mnt(a) *(min_element(a.begin(),a.end())
#define tc ll t;cin>>t;while(t--)
typedef pair<ll,ll> pi;
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yesno(f) if(f) yes else no
const v dx = {1, -1, 0, 0};
const v dy = {0, 0, 1, -1};
const ll mod=1e9+7;
const ld PI = 2 * acos(0.0);
ll m(ll a){ return (a+mod)%mod;}
ll cel(ll x1,ll y1){if((x1%y1)==0)return x1/y1;else return x1/y1+1;}
ll power(ll a,ll b,ll m)
{
    if(b==0)
        return 1;
    ll d=power(a,b/2,m);
    d=(d*d)%m;
    if(b&1)
        d=(d*a)%m;
    return d;
}
// set_name.find_by_order(k) It returns to an iterator to the kth element (counting from zero) in the set in O(logn) time
// set_name.order_of_key(k) It returns to the number of items that are strictly smaller than our item k in O(logn) time.
/*string operations :
str.substr (x,y) : returns a substring str[x],str[x+1],...str[x+y-1]
str.substr (x) : returns a substring str[x],... end of string
str.find(qtr) : returns the first occurenece of qtr in str */
int solve(){}
int ans1[200005],szz[200005],ans2[200005],fact[200005];
int ncr(int n,int r)
{
    int denom=(fact[n-r]*fact[r])%mod;
    denom=power(denom,mod-2,mod);
    return (fact[n]*denom)%mod;

}
void dfs(int u,int pa,vv &gr)
{
    szz[u]=1;   
    for(auto it:gr[u])
    {
        if(it!=pa)
        {
            dfs(it,u,gr);
            szz[u]+=szz[it];
        }
    }
    int left=szz[u]-1;
    ans1[u]=1;
    for(auto it:gr[u])
    {
        if(it!=pa)
        {
            ans1[u]*=ans1[it];
            ans1[u]%=mod;
            ans1[u]*=ncr(left,szz[it]);
            ans1[u]%=mod;
            left-=szz[it];
        }
    }
}
void dfs2(int u,int pa,vv &gr,int n)
{
    if(pa==-1)
    {
        ans2[u]=ans1[u];
    }
    else
    {
        int denom=(ncr(n-1,szz[u])*ans1[u])%mod;
        denom=power(denom,mod-2,mod);
        denom*=ans2[pa];
        denom%=mod;
        ans2[u]=denom;
        int left=n-1;
        ans2[u]*=ncr(left,n-szz[u]);
        ans2[u]%=mod;
        left-=(n-szz[u]);

        for(auto it:gr[u])
        {
            if(it!=pa)
            {
                ans2[u]*=ans1[it];
                ans2[u]%=mod;
                ans2[u]*=ncr(left,szz[it]);
                ans2[u]%=mod;
                left-=szz[it];
            }
        }

    }
    for(auto it:gr[u])
    {
        if(it!=pa)
            dfs2(it,u,gr,n);
    }
}
int32_t main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    int n;cin>>n;
    vv gr(n);
    fact[0]=1;
    for(int i=1;i<200005;i++)
    {
        fact[i]=(fact[i-1]*i)%mod;
    }
    f(i,n-1)
    {
        int a,b;cin>>a>>b;
        a--;
        b--;
        gr[a].pb(b);
        gr[b].pb(a);
    }
    dfs(0,-1,gr);
    dfs2(0,-1,gr,n);
    for(int i=0;i<n;i++)
        cout<<ans2[i]<<endl;
    return 0;
}

Measured memory_bytes: 20976