#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll MODPOW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = MODPOW(n, m / 2);
    return (tmp * tmp) % MOD;
  } else {
    return (n * MODPOW(n, m - 1)) % MOD;
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll MODDIV(ll a, ll b) { return a * MODPOW(b, MOD - 2) % MOD; }

ll nCr(vl &f, ll n, ll r) {
  if (n < r)
    return 0LL;
  if (r > n / 2LL)
    r = n - r;
  ll res = (f[n] * MODPOW(f[n - r], MOD - 2LL)) % MOD;
  res = (res * MODPOW(f[r], MOD - 2LL)) % MOD;
  return res;
}

void dfs1(vvl &G, vl &dp, vl &sz, vl &fact, ll now, ll par) {
  sz[now] = 1;
  dp[now] = 1;
  AUTO(g, G[now]) {
    if (g == par)
      continue;
    dfs1(G, dp, sz, fact, g, now);
    sz[now] += sz[g];
    dp[now] = (MODDIV(dp[now], fact[sz[g]]) * dp[g]) % MOD;
  }
  dp[now] = dp[now] * fact[sz[now] - 1] % MOD;
}

void dfs2(vvl &G, vl &ans, vl &dp, vl &sz, vl &fact, ll N, ll now, ll par) {
  if (now != 0) {
    ll po =
        (ans[par] * MODDIV(1, dp[now] * nCr(fact, N - 1, sz[now]) % MOD)) % MOD;
    po = (po * dp[now]) % MOD;
    ans[now] = (po * nCr(fact, N - 1, N - sz[now])) % MOD;
  }
  AUTO(g, G[now]) {
    if (g == par)
      continue;
    dfs2(G, ans, dp, sz, fact, N, g, now);
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl A(N), B(N);
  vvl G(N);
  vl D(N, 0);
  vl f(N + 1, 0);
  f[0] = 1;
  REP(i, N - 1) {
    cin >> A[i] >> B[i];
    G[A[i] - 1].push_back(B[i] - 1);
    G[B[i] - 1].push_back(A[i] - 1);
  }

  FOR(i, 1, N + 1) f[i] = (f[i - 1] * i) % MOD;

  vl dp(N, 0);
  vl sz(N, 0);
  dfs1(G, dp, sz, f, 0, -1);
  vl ans(N, 0);
  ans[0] = dp[0];
  dfs2(G, ans, dp, sz, f, N, 0, -1);
  REP(i, N) cout << ans[i] << endl;

  return 0;
}


Measured memory_bytes: 26000