#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 200005;

vector<int> G[N];
int sz[N];
LL ans[N];
LL now = 1;
LL pow_mod(LL x, LL n) {
    LL res = 1;
    while (n) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}
void dfs1(int u, int fa) {
    sz[u] = 1;
    for (auto v : G[u]) {
        if (v == fa) continue;
        dfs1(v, u);
        sz[u] += sz[v];
    }
}
int n;
void dfs2(int u, int fa) {
    ans[u] = pow_mod(now, mod - 2);
    for (auto v : G[u]) {
        if (v == fa) continue;
        now = now * pow_mod(sz[v], mod - 2) % mod * (n - sz[v]) % mod;
        dfs2(v, u);
        now = now * pow_mod(n - sz[v], mod - 2) % mod * sz[v] % mod;
    }
}
int main() {
    cin >> n;
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs1(1, 0);
    for (int i = 1; i <= n; i++) {
        now = now * sz[i] % mod;
    }
    dfs2(1, 0);
    LL wc = 1;
    for (int i = 1; i <= n; i++) wc = wc * i % mod;
    for (int i = 1; i <= n; i++) {
        printf("%lld\n", ans[i] * wc % mod);
    }
    return 0;
}
