/**
 *    author:  otera    
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
        return is >> x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

// 二項係数ライブラリ
template<class T> struct BiCoef {
    vector<T> fact_, inv_, finv_;
    constexpr BiCoef() {}
    constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
        init(n);
    }
    constexpr void init(int n) noexcept {
        fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
        int MOD = fact_[0].getmod();
        for(int i = 2; i < n; i++){
            fact_[i] = fact_[i-1] * i;
            inv_[i] = -inv_[MOD%i] * (MOD/i);
            finv_[i] = finv_[i-1] * inv_[i];
        }
    }
    constexpr T com(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[k] * finv_[n-k];
    }
    constexpr T fact(int n) const noexcept {
        if (n < 0) return 0;
        return fact_[n];
    }
    constexpr T inv(int n) const noexcept {
        if (n < 0) return 0;
        return inv_[n];
    }
    constexpr T finv(int n) const noexcept {
        if (n < 0) return 0;
        return finv_[n];
    }
};

const int MOD = 1000000007;
//const int MOD = 998244353;
using mint = Fp<MOD>;
BiCoef<mint> bc;

int n;
vector<vector<int>> g;

vector<vector<pair<mint, int>>> dp;

pair<mint, int> rec(int v, int p) {
    dp[v].assign((int)g[v].size(), {(mint)1, 0});
    int cnt = 0; mint res = (mint)1;
    rep(i, g[v].size()) {
        if(g[v][i] == p) continue;
        dp[v][i] = rec(g[v][i], v);
        res *= dp[v][i].fr * bc.com(cnt + dp[v][i].sc, cnt);
        cnt += dp[v][i].sc;
    }
    return {res, cnt + 1};
}

void rerec(int v, int p, pair<mint, int> pval) {
    rep(i, g[v].size()) {
        if(g[v][i] == p) {
            dp[v][i] = pval;
        }
    }
    int sz = (int)g[v].size();
    vector<pair<mint, int>> left(sz + 1, {(mint)1, 0}), right(sz + 1, {(mint)1, 0});
    rep(i, g[v].size()) {
        left[i + 1].fr = left[i].fr * dp[v][i].fr * bc.com(left[i].sc + dp[v][i].sc, left[i].sc);
        left[i + 1].sc = left[i].sc + dp[v][i].sc;
    }
    rep(i, g[v].size()) {
        right[i + 1].fr = right[i].fr * dp[v][sz - 1 - i].fr * bc.com(right[i].sc + dp[v][sz - 1 - i].sc, right[i].sc);
        right[i + 1].sc = right[i].sc + dp[v][sz - 1 - i].sc;
    }
    rep(i, g[v].size()) {
        if(g[v][i] == p) continue;
        pair<mint, int> val = left[i];
        val.fr *= right[sz - 1 - i].fr * bc.com(val.sc + right[sz - 1 - i].sc, val.sc);
        val.sc += right[sz - 1 - i].sc;
        val.sc ++;
        rerec(g[v][i], v, val);
    }
}

void solve() {
	cin >> n;
    g.assign(n, vector<int>());
    dp.resize(n);
    rep(i, n - 1) {
        int a, b; cin >> a >> b;
        --a, --b;
        g[a].pb(b);
        g[b].pb(a);
    }
    bc.init(600600);
    rec(0, -1);
    rerec(0, -1, {1, 0});
    rep(v, n) {
        int cnt = 0; mint res = (mint)1;
        rep(i, g[v].size()) {
            //cerr << v << " " << g[v][i] << " " << dp[v][i].fr << " " << dp[v][i].sc << endl;
            res *= dp[v][i].fr * bc.com(cnt + dp[v][i].sc, cnt);
            cnt += dp[v][i].sc;
        }
        cout << res << endl;
        //cerr << "cnt = " << cnt << endl;
    }
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 46452