#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

template<int Modulus> 
struct ModInt {
    long long x;
    ModInt(long long x = 0) :x((x%Modulus + Modulus)%Modulus) {}
    constexpr ModInt &operator+=(const ModInt a) {if ((x += a.x) >= Modulus) x -= Modulus; return *this;}
    constexpr ModInt &operator-=(const ModInt a) {if ((x += Modulus - a.x) >= Modulus) x -= Modulus; return *this;}
    constexpr ModInt &operator*=(const ModInt a) {(x *= a.x) %= Modulus; return *this;}
    constexpr ModInt &operator/=(const ModInt a) {return *this *= a.inverse();}

    constexpr ModInt operator+(const ModInt a) const {return ModInt(*this) += a.x;}
    constexpr ModInt operator-(const ModInt a) const {return ModInt(*this) -= a.x;}
    constexpr ModInt operator*(const ModInt a) const {return ModInt(*this) *= a.x;}
    constexpr ModInt operator/(const ModInt a) const {return ModInt(*this) /= a.x;}
    
    friend constexpr ostream& operator<<(ostream& os,const ModInt<Modulus>& a) {return os << a.x;}
    friend constexpr istream& operator>>(istream& is,ModInt<Modulus>& a) {return is >> a.x;}
    
    ModInt inverse() const {// x ^ (-1) 
        long long a = x,b = Modulus,p = 1,q = 0;
        while (b) {long long d = a/b; a -= d*b; swap(a,b); p -= d*q; swap(p,q);}
        return ModInt(p);
    }
    ModInt pow(long long N) {// x ^ N 
        ModInt a = 1;
        while (N) {
            if (N&1) a *= *this;
            *this *= *this;
            N >>= 1;
        }
        return a;
    }
};

using mint = ModInt<1000000007>;
//using mint = ModInt<998244353>;
struct Combination {
    int N;
    //using mint = ModInt<1000000007>;
    //using mint = ModInt<998244353>;
    vector<mint> fact,ifact,invs;
    Combination(int N): N(N) {
        fact.resize(N + 1); ifact.resize(N + 1);
        fact[0] = fact[1] = 1;
        ifact[0] = ifact[1] = 1;
        for (int i = 2;i < N + 1;++i) {fact[i] = fact[i - 1] * i;}
        ifact[N] = fact[N].inverse();
        for (int i = N;i >= 1;--i) {ifact[i - 1] = ifact[i] * i;}
    }
    void invs_build() {
        invs.resize(N + 1);
        invs[1] = 1;
        for (int i = 2;i < N + 1;++i) invs[i] = fact[i] * ifact[i - 1];
    }
    mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n - k];
    }
    mint npk(int n,int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[n - k];
    }
} comb(200010);

struct DP {
    mint dp;
    int t;
    DP(mint dp = 1,int t = 0):dp(dp),t(t) {}
    DP operator+(const DP &a) const {
        return DP(dp*a.dp*comb(t + a.t,t),t + a.t);
    }
    DP addroot() const {
        return DP(dp,t + 1);
    }
};
DP unit = DP();

template<class T>
struct Rerooting {
    int N;
    vector<int> parents;
    vector<vector<int>> G;
    vector<vector<T>> dp;
    vector<T> ans;
    Rerooting(int N,const vector<vector<int>> &G):N(N),G(G) {
        parents.assign(N,-1);
        dp.resize(N);
        ans.resize(N);
        dfs(0); 
        bfs(0);
    }
    T dfs(int v,int p = -1) {
        T ret = unit;
        dp[v] = vector<T>(G[v].size());
        for (int i = 0;i < (int)G[v].size(); ++i) {
            if (p == G[v][i]) {
                parents[v] = i;
                continue;
            }
            dp[v][i] = dfs(G[v][i],v);
            ret = ret + dp[v][i];
        }
        return ret.addroot();
    } 
    void bfs(int v,const T &res_p = unit,int p = -1) {
        if (p != -1) dp[v][parents[v]] = res_p;
        int deg = G[v].size();
        vector<T> dpl(deg + 1),dpr(deg + 1);
        dpl[0] = unit; dpr[deg] = unit;
        for (int i = 0;i < deg; ++i) dpl[i + 1] = dpl[i] + dp[v][i];
        for (int i = deg - 1; i >= 0; --i) dpr[i] = dpr[i + 1] + dp[v][i];
        ans[v] = dpr[0].addroot();
        for (int i = 0;i < deg; ++i) {
            if (parents[v] == i) continue;
            T d = dpl[i] + dpr[i + 1];
            bfs(G[v][i],d.addroot(),v);
        }
    }
    T operator[](int k) {
        return ans[k];
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N; cin >> N;
    vector<vector<int>> G(N);
    rep(i,N - 1) {
        int a,b; cin >> a >> b;
        --a; --b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    Rerooting<DP> rt(N,G);
    rep(i,N) cout << rt[i].dp << '\n';
    return 0;
}

Measured memory_bytes: 54076