/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool (win, osx, linux)
 * Author: step_by_step
 * Time: 2020-03-19 17:35:03
**/

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define prev fhsgfhjf
#define plus fsghsf
#define minus ytryr
  
using namespace std;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 200000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

ll bin_pow(ll a, ll p) {
    ll res = 1;
    while (p) {
        if (p & 1) {
            res = res * a % MOD;
        }
        a = a * a % MOD;
        p >>= 1;
    }
    return res;
}

ll rev(ll x) {
    return bin_pow(x, MOD - 2);
}

ll fact[N + 1], rfact[N + 1];

void init() {
    fact[0] = 1;
    rep(i, 1, N + 1) {
        fact[i] = fact[i - 1] * i % MOD;
    }

    rfact[N] = rev(fact[N]);
    repb(i, N - 1, -1) {
        rfact[i] = rfact[i + 1] * (i + 1) % MOD;
    }
}

ll C(int n, int k) {
    return fact[n] * rfact[k] % MOD * rfact[n - k] % MOD;
}

vector<int> g[N];
ll cnt[N];
int sz[N];

int dfs(int u, int par) {
    sz[u] = 1;
    cnt[u] = 1;
    for (int v : g[u]) {
        if (v != par) {
            sz[u] += dfs(v, u);
            cnt[u] = cnt[u] * cnt[v] % MOD;
        }
    }
    int rem = sz[u] - 1;
    for (int v : g[u]) {
        if (v != par) {
            cnt[u] = cnt[u] * C(rem, sz[v]) % MOD;
            rem -= sz[v];
        }
    }
    return sz[u];
}

int n;
ll ans[N];

void dfs1(int u, int par, ll cnt_in) {
    ans[u] = cnt[u] * cnt_in % MOD;
    ans[u] = ans[u] * C(n - 1, n - sz[u]) % MOD;
    for (int v : g[u]) {
        if (v != par) {
            ll val = ans[u] * rev(cnt[v]) % MOD;
            val = val * rev(C(n - 1, sz[v])) % MOD;
            dfs1(v, u, val);
        }
    }
}

int main()
{
    //freopen("circus.in", "r", stdin);
    //freopen("circus.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    init();
    cin >> n;
    rep(i, 0, n - 1) {
        int u, v;
        cin >> u >> v; u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    dfs(0, -1);
    dfs1(0, -1, 1);

    rep(i, 0, n) {
        cout << ans[i] << " ";
    }
    cout << "\n";
    return 0;
}



Measured memory_bytes: 20980