#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void IN(void){return;}
template <typename First, typename... Rest> void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
inline void OUT(void){cout << "\n";return;}
template <typename First, typename... Rest> void OUT(First first, Rest... rest){cout << first << " ";OUT(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long LLINF = 1e18;
long long lcm(ll a, ll b){return a * b / __gcd(a,b);}
struct IoSetup { IoSetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
} } iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
    os << p.first << " " << p.second;
    return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}
template <typename T> void Exit(T first){cout << first << endl;exit(0); };
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

template< typename Data, typename T >
struct ReRooting{

    struct Node {
        int to, rev;
        Data data;
    };

    using F1 = function< T(T, T) >;
    using F2 = function< T(T, Data) > ;

    vector< vector< Node > > g;
    vector< vector< T > > ldp, rdp;
    vector< int > lptr, rptr;
    const F1 f1;
    const F2 f2;
    const T ident;

    ReRooting(int n, const F1 &f1, const F2 &f2, const T &ident) :
        g(n), ldp(n), rdp(n), lptr(n), rptr(n), f1(f1), f2(f2), ident(ident) {}

    void add_edge(int u, int v, const Data &d){
        g[u].emplace_back((Node){v, (int) g[v].size(), d});
        g[v].emplace_back((Node){u, (int) g[u].size() - 1, d});
    }

    void add_edge_bi(int u, int v, const Data &d, const Data &e){
        g[u].emplace_back((Node) {v, (int) g[v].size(), d});
        g[v].emplace_back((Node) {u, (int) g[u].size() - 1, e});
    }

    T dfs(int idx, int par){

        while(lptr[idx] != par && lptr[idx] < g[idx].size()){
            auto &e = g[idx][lptr[idx]];
            ldp[idx][lptr[idx] + 1] = f1(ldp[idx][lptr[idx]], f2(dfs(e.to, e.rev), e.data));
            ++lptr[idx];
        }
        while(rptr[idx] != par && rptr[idx] >= 0){
            auto &e = g[idx][rptr[idx]];
            rdp[idx][rptr[idx]] = f1(rdp[idx][rptr[idx] + 1], f2(dfs(e.to, e.rev), e.data));
            --rptr[idx];
        }
        if(par < 0) return rdp[idx][0];
        return f1(ldp[idx][par], rdp[idx][par + 1]);
    }

    vector< T > solve(){
        for(int i = 0; i < g.size(); i++){
            ldp[i].assign(g[i].size() + 1, ident);
            rdp[i].assign(g[i].size() + 1, ident);
            lptr[i] = 0;
            rptr[i] = (int) g[i].size() - 1;
        }
        vector< T > ret;
        for(int i = 0; i < g.size(); i++){
            ret.push_back(dfs(i, -1));
        }
        return ret;
    }
};

static const long long MOD=1e9 + 7;

long long modinv(long long a, const long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}//mod mでの逆元aを計算

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

struct combination{
    int mod = MOD;
    vector<long long> fact, ifact, inv;
    combination(int n, const int tmp = MOD):fact(n+1), ifact(n + 1), inv(n+1){
        mod = tmp;
        assert(n < mod);
        fact[0] = 1;
        for(int i = 1; i <= n; i++) fact[i] = fact[i-1]*i%mod;
        ifact[n] = modpow(fact[n], mod - 2, mod);
        for(int i = n; i >= 1; --i) ifact[i-1] = ifact[i] * i%mod;
        for(int i = 1; i <= n; i++) inv[i] = fact[i-1] * ifact[i] % mod;
    }
    long long C(int n, int k){
        if(k < 0 || k > n) return 0;
        return fact[n]*ifact[k]%mod*ifact[n-k] % mod;
    }
};
// combination cb(10, 11); 
// cout << cb.C(10, 3) << endl;


int main(){
    iosetup;
    int N; cin >> N;
    combination cb(N); 
    using pi = pair< modint, int >;
    auto f1 = [&](const pi& a,const pi& b){
        return pi(a.first * b.first * cb.C(a.second + b.second, a.second), a.second + b.second);
    };
    auto f2 = [](const pi& a, int b){
        return pi(a.first, a.second + 1);
    };

    ReRooting< int, pi > g(N, f1, f2, pi(modint(1), 0));
    for(int i = 1; i < N; i++){
        int a, b; cin >> a >> b; a--, b--;
        g.add_edge(a, b, 1);
    }
    auto res = g.solve();
    for(auto& e: res){
        cout << e.first << endl;
    }
    return 0;
}


Measured memory_bytes: 50992