#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

template <int mod>
struct ModInt {
  int x;
  ModInt(): x(0) {}
  ModInt(long long a) { x = a % mod; if (x < 0) x += mod; }
  ModInt &operator+=(ModInt that) { x = (x + that.x) % mod; return *this; }
  ModInt &operator-=(ModInt that) { x = (x + mod - that.x) % mod; return *this; }
  ModInt &operator*=(ModInt that) { x = (long long) x * that.x % mod; return *this; }
  ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
  ModInt inverse() {
    int a = x, b = mod, u = 1, v = 0;
    while (b) { int t = a / b; a -= t * b; u -= t * v; swap(a, b); swap(u, v); }
    return ModInt(u);
  }
  #define op(o, p) ModInt operator o(ModInt that) { return ModInt(*this) p that; }
    op(+, +=) op(-, -=) op(*, *=) op(/, /=)
  #undef op
  friend ostream& operator<<(ostream &os, ModInt m) { return os << m.x; }
};

using mint = ModInt<1000000007>;

template <typename T>
struct ModCalc {
  vector<T> fac, finv;
  ModCalc(int max) {
    fac = vector<T>(max + 1);
    finv = vector<T>(max + 1);
    fac[0] = 1;
    reps(i, max) fac[i] = fac[i - 1] * i;
    finv[max] = (T) 1 / fac[max];
    rreps(i, max) finv[i - 1] = finv[i] * i;
  }
  T com(int a, int b) {
    if (a < 0 || b < 0 || b > a) return 0;
    return fac[a] * finv[a - b] * finv[b];
  }
};

using mcalc = ModCalc<mint>;

void solve() {
  auto mc = mcalc(200001);

  int n;
  cin >> n;
  vector<vi32> g(n);
  rep(i, n - 1) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }

  #define fi first
  #define se second

  using P = pair<int, mint>;
  
  auto merge = [&](P a, P b) -> P {
    int count = a.fi + b.fi;
    mint ret = mc.com(count, a.fi) * a.se * b.se;
    return make_pair(count, ret);
  };

  vector<vector<P>> dp(n);
  auto dfs = [&](auto dfs, int u, int p) -> P {
    P ret(0, 1);
    dp[u] = vector<P>(sz(g[u]));
    rep(i, sz(g[u])) {
      int v = g[u][i];
      if (v == p) {
        continue;
      }
      dp[u][i] = dfs(dfs, v, u);
      ret = merge(ret, dp[u][i]);
    }
    ret.fi += 1;
    return ret;
  };
  dfs(dfs, 0, -1);

  vector<mint> ans(n);
  auto bfs = [&](auto bfs, int u, int p, int count, mint ret) -> void {
    int m = sz(g[u]);
    rep(i, m) {
      int v = g[u][i];
      if (v == p) {
        dp[u][i] = make_pair(count, ret);
      }
    }
    vector<P> dpl(m + 1);
    vector<P> dpr(m + 1);
    dpl[0] = P(0, 1);
    dpr[m] = P(0, 1);
    rep(i, m) {
      dpl[i + 1] = merge(dpl[i], dp[u][i]);
    }
    rrep(i, m) {
      dpr[i] = merge(dpr[i + 1], dp[u][i]);
    }
    ans[u] = dpl[m].se;
    rep(i, m) {
      int v = g[u][i];
      if (v == p) continue;
      P me = merge(dpl[i], dpr[i + 1]);
      bfs(bfs, v, u, me.fi + 1, me.se);
    }
  };
  bfs(bfs, 0, -1, 0, 1);

  rep(i, n) {
    cout << ans[i] << endl;
  }
}

Measured memory_bytes: 29940