#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
#include <numeric>
#include <string.h>
#include <sys/time.h>
#include <random>


#define fs first
#define sc second

using namespace std;

typedef long long ll;
typedef unsigned int uint;
typedef pair<ll, ll> P;


class modInt{
    ll value;
    static const ll mod = 1000000007;

public:
    modInt(ll x): value{x % mod}{}

    inline modInt& operator+=(modInt x){
        value = (value + x.value) % mod;
        return *this;
    }

    inline modInt& operator-=(modInt x){
        value = (value + mod - x.value) % mod;
        return *this;
    }

    inline modInt& operator*=(modInt x){
        value = (value * x.value) % mod;
        return *this;
    }


    inline modInt operator/=(modInt x){
        *this *= x.inv();
        return *this;
    }

    inline modInt pow(modInt x, int n){
        modInt res = modInt(1LL);
        while(n > 0){
            if(n & 1)   res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    inline modInt inv(){
        modInt res = pow(value, mod-2);
        return res;
    }

    inline ll get(){
        return value;
    }
};

modInt operator+(modInt x, modInt y){
    return x += y;
}

modInt operator-(modInt x, modInt y){
    return x -= y;
}

modInt operator*(modInt x, modInt y){
    return x *= y;
}

modInt operator/(modInt x, modInt y){
    return x /= y;
}

ostream& operator<<(ostream& os, modInt x){
    return os << x.get();
}


class modIntCombinations{
    vector<modInt> factArray;

    void make_fact(ll x){
        for(auto i = factArray.size(); i <= x+1; i++){
            modInt y = factArray[i-1] * i;
            factArray.push_back(y);
        }
    }

public:
    modIntCombinations(){
        factArray.emplace_back(1);
    }

    modInt fact(ll x){
        if(factArray.size() < x+1){
            make_fact(x);
        }
        return factArray[x];
    }

    modInt comb(ll n, ll k){
        if(n < k){
            return modInt{0};
        }
        else{
            return fact(n) / fact(k) / fact(n - k);
        }
    }

    modInt perm(ll n, ll k){
        if(n < k){
            return modInt{0};
        }
        else{
            return fact(n) / fact(k);
        }
    }
};


class Graph{
    struct edge{
        int vertice;
        ll weight;
    };

    vector<vector<edge>> g;
    unsigned int n;

public:
    Graph(unsigned int n): n{n}{
        g.resize(n);
    }

    void add_edge(int u, int v){
        g[u].emplace_back(edge{v, 1});
    };

    void add_edge(int u, int v, ll w){
        g[u].emplace_back(edge{v, w});
    }

    vector<edge>& get_edge(int v){
        return g[v];
    }

    unsigned int get_num_vertices(){
        return n;
    }

    vector<edge>& operator[](int v){
        return get_edge(v);
    }
};

int child[201000];
vector<modInt> childRes(201000, 0LL);
vector<modInt> resList(201000, 0LL);


modInt dfs(int v, int prev, Graph& g, modIntCombinations& mic){
    modInt res = modInt{1};
    int num = 0, childSum = 0;
    for(auto u: g[v]){
        if(u.vertice == prev)   continue;
        modInt x = dfs(u.vertice, v, g, mic);
        res *= x;
        num += child[u.vertice];
        childSum += child[u.vertice];
    }
    for(auto u: g[v]){
        if(u.vertice == prev) continue;
        int childNum = child[u.vertice];
        res *= mic.comb(num, childNum);
        num -= childNum;
    }
    childSum++;
    child[v] = childSum;
    childRes[v] = res;

    return res;
}

void dfs2(int v, int prev, Graph& g, modIntCombinations& mic, int N, modInt from){
    modInt res = childRes[v];
    int remained = N - child[v];
    res *= mic.comb(N-1, remained);
    res *= from;
    resList[v] = res;

    for(auto u: g[v]){
        if(u.vertice == prev)   continue;
        dfs2(u.vertice, v, g, mic, N, res / mic.comb(N-1, child[u.vertice]) / childRes[u.vertice]);
    }
}


int main(){
    int N;
    cin >> N;
    Graph g(N);
    for(int i = 0; i < N-1; i++){
        int a, b;   cin >> a >> b;
        a--; b--;
        g.add_edge(a, b);
        g.add_edge(b, a);
    }
    modIntCombinations mic{};

    modInt res1 = dfs(0, 0, g, mic);
    resList[0] = res1;
    for(auto u: g[0]){
//        mp[0][u.vertice] = res1 / mic.comb(N-1, child[u.vertice]) / childRes[u.vertice];
        dfs2(u.vertice, 0, g, mic, N, res1 / mic.comb(N-1, child[u.vertice]) / childRes[u.vertice]);
    }

    for(int i = 0; i < N; i++){
        cout << resList[i] << endl;
    }



    return 0;
}

Measured memory_bytes: 24428