#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define chadd(x, y) x = (x + y) % mod

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>;

template<typename T>
struct Combination{
    int sz;
    vector<T> fact_;
    vector<T> ifact_;
    vector<T> inv_;
    
    Combination(int n = 1e+6) : sz(n) {
        fact_.resize(sz + 1);
        ifact_.resize(sz + 1);
        inv_.resize(sz + 1);

        fact_[0] = ifact_[sz] = inv_[0] = 1;
        for(int i = 1; i <= sz; ++i)    fact_[i] = fact_[i - 1] * i;
        ifact_[sz] /= fact_[sz];
        for(int i = sz; i > 0; --i)     ifact_[i - 1] = ifact_[i] * i;
        for(int i = 1; i <= sz; ++i)    inv_[i] = ifact_[i] * fact_[i - 1];
    }

    inline T fact(int k) const  {return fact_[k];}
    inline T ifact(int k) const {return ifact_[k];}
    inline T inv(int k) const   {return inv_[k];}

    T get_permutation(int n, int k){
        if(n < 0 || k < 0 || n < k)     return 0;
        return fact(n) * ifact(n - k);
    }

    T get_combination(int n, int k){
        if(n < 0 || k < 0 || n < k)     return 0;
        return fact(n) * ifact(k) * ifact(n - k);
    }
};

int n;
vector<vector<int>> graph;
vector<int> partial(200005, 0);     // 部分木サイズ
vector<modint> dp(200005, -1);      // 頂点0 を根としたときの木DP
vector<modint> product(200005, 1);  // 累積積
vector<modint> dp2(200005, -1);     // 全方位木DP
Combination<modint> c(200005);

// 頂点 0 を根として部分木サイズを計算
int calc_size(int from = 0, int p = -1){
    int res = 1;
    for(int to : graph[from]){
        if(to == p) continue;
        res += calc_size(to, from);
    }
    return partial[from] = res;
}

// 頂点 0 を根としたときの木DP
modint dfs(int from = 0, int p = -1){
    if(dp[from] != -1)  return dp[from];
    modint res = c.fact(partial[from] - 1);
    for(int to : graph[from]){
        if(to == p) continue;
        res *= c.ifact(partial[to]);
        res *= dfs(to, from);
        product[from] *= dfs(to, from);
    }
    return dp[from] = res;
}

// 全方位木DP
void dfs2(int from = 0, int p = -1){
    if(p == -1){
        dp2[from] = dp[from];
        for(int to : graph[from])   dfs2(to, from);
        return;
    }

    // 頂点 from から上方向の部分木の dp 値を計算
    // dp2[p] = (n - 1)! * (szv1^-1 * szv2^-1 * ...) * (dpv1 * dpv2 * ...)
    // v1, v2... は 頂点 p を根としたときの子ノード　sz は部分木のサイズ
    // この値から from 方向の値を消す -> (szfrom * dpfrom^-1) を掛ける
    // 頂点数の帳尻を合わせる -> (n - szfrom - 1) * (n - 1)!^-1 を掛ける
    dp2[from] = dp2[p];
    dp2[from] *= c.fact(partial[from]) * dp[from].inverse();
    dp2[from] *= c.fact(n - partial[from] - 1) * c.ifact(n - 1);
    
    // dp2[from] を求める時に全体に掛ける必要のあるものも予め掛けておく
    // (これがあるので、(n-1)の階乗と階乗の逆元は書かなくてもよい)
    // (n - 1)! * (n - szfrom)!^-1 を掛けておく
    // (n - szfrom) は 頂点 from の上方向にある部分木のサイズ
    dp2[from] *= c.fact(n - 1) * c.ifact(n - partial[from]);

    // 下方向の dp 値をマージ
    for(int to : graph[from]){
        if(to == p) continue;
        dp2[from] *= dp[to];
        dp2[from] *= c.ifact(partial[to]);
    }

    // dp2 値を計算してから、子ノードを辿る (辿った先で利用するため)
    for(int to : graph[from]){
        if(to == p) continue;
        dfs2(to, from);
    }

    return;
}

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

    cin >> n;
    graph.resize(n);
    for(int i = 0; i < n - 1; ++i){
        int a, b;
        cin >> a >> b;
        --a, --b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    calc_size();
    dfs();
    dfs2();
    for(int i = 0; i < n; ++i)  cout << dp2[i] << "\n";
}

Measured memory_bytes: 19444