// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;

#define _GLIBCXX_DEBUG

#define rep2(i, m, n) for(int i=int(m); i<int(n); i++)

#define rep(i, n) rep2(i, 0, n)

#define all(a) a.begin(), a.end()

#define fst first

#define snd second

using ll = long long;

using ld = long double;

using V = vector<int>;

using Vll = vector<ll>;

using Vld = vector<ld>;

using VV = vector<V>;

using VVll = vector<Vll>;

using VVld = vector<Vld>;

using P = pair<int, int>;

using Pll = pair<ll, ll>;

using Pld = pair<ld, ld>;

const int INF = 1<<30;

const ll INFll = 1ll<<62;

const ld EPS = 1e-10;

const int MOD = int(1e9)+7;

template<typename T> inline bool chmin(T& a, T b) {if(a>b) {a=b; return true;} return false;}

template<typename T> inline bool chmax(T& a, T b) {if(a<b) {a=b; return true;} return false;}

template<typename T> inline int Log2(T& x) {int k; for(k=0; (T(1)<<k)<=x; ++k); return k;} // number of binary digits





const int mod = int(1e9)+7;

struct mint {

  ll x;

  mint(ll x=0):x((x%mod+mod)%mod){}

  mint operator-() const { return mint(-x);}

  mint& operator+=(const mint a) {

    if ((x += a.x) >= mod) x -= mod;

    return *this;

  }

  mint& operator-=(const mint a) {

    if ((x += mod-a.x) >= mod) x -= mod;

    return *this;

  }

  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}

  mint operator+(const mint a) const { return mint(*this) += a;}

  mint operator-(const mint a) const { return mint(*this) -= a;}

  mint operator*(const mint a) const { return mint(*this) *= a;}

  mint pow(ll t) const {

    if (!t) return 1;

    mint a = pow(t>>1);

    a *= a;

    if (t&1) a *= *this;

    return a;

  }



  // for prime mod

  mint inv() const { return pow(mod-2);}

  mint& operator/=(const mint a) { return *this *= a.inv();}

  mint operator/(const mint a) const { return mint(*this) /= a;}

};

istream& operator>>(istream& is, const mint& a) { return is >> a.x;}

ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}





// initialization

const int MAX = int(2e5)+10;

mint fac[MAX];

void binom_init() {

  fac[0] = fac[1] = 1;

  for (int i = 2; i < MAX; ++i) fac[i] = fac[i-1] * i;

}



mint binom(int n, int k) {

  if (k < 0 || n < k) return 0;

  return fac[n] / (fac[k] * fac[n-k]);

}





// DP

using Tdp = pair<mint, int>;

struct edge {

  int u, v; Tdp dp_sub;

  edge(int v) : u(-1), v(v), dp_sub() {}

};

Tdp f_merge(Tdp a, Tdp b) {

  return Tdp(a.fst * b.fst * binom(a.snd + b.snd, a.snd), a.snd + b.snd);

}

Tdp f_trans(Tdp a) {

  return Tdp(a.fst, a.snd+1);

}



using Edges = vector<edge>;

using Graph = vector<Edges>;

Graph G;



Tdp dfs(int u, int p=-1) {

  Tdp res = Tdp(1, 0);

  int d = G[u].size();

  for (auto &e : G[u]) {

    if (e.v == p) continue;

    e.dp_sub = dfs(e.v, u);

    res = f_merge(res, e.dp_sub);

  }

  return f_trans(res);

}



vector<Tdp> dp;

void dfs2(int u, Tdp par, int p=-1) {

  int d = G[u].size();

  rep(i, d) if (G[u][i].v == p) G[u][i].dp_sub = par;



  dp[u] = Tdp(1, 0);

  for (auto &e : G[u]) dp[u] = f_merge(dp[u], e.dp_sub);



  vector<Tdp> res_l(d+1, Tdp(1, 0));

  vector<Tdp> res_r(d+1, Tdp(1, 0));

  rep(i, d) {

    res_l[i+1]   = f_merge(res_l[i],   G[u][i].dp_sub);

    res_r[d-i-1] = f_merge(res_r[d-i], G[u][d-i-1].dp_sub);

  }



  rep(i, d) {

    auto e = G[u][i];

    if (e.v == p) continue;

    dfs2(e.v, f_trans(f_merge(res_l[i], res_r[i+1])), u);

  }

}





int main() {

  binom_init();

  int N; cin >> N;



  G = Graph(N);

  for (int i = 0; i < N-1; ++i) {

    int a, b;

    cin >> a >> b;

    a--; b--;

    G[a].push_back(edge(b));

    G[b].push_back(edge(a));

  }



  dp = vector<Tdp>(N);

  dfs(0);

  dfs2(0, Tdp(1, 0));

  rep(i, N) cout << dp[i].fst << endl;

  return 0;

}

// Optimized solution to the same problem (faster):
#include <bits/stdc++.h>

using namespace std;

#define rep2(i, m, n) for (int i = (m); i < (n); ++i)

#define rep(i, n) rep2(i, 0, n)

#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)

#define drep(i, n) drep2(i, n, 0)

#define all(x) (x).begin(), (x).end()

#define rall(x) (x).rbegin(), (x).rend()

#ifdef LOCAL

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }

#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl

#else

#define debug(...) (void(0))

#define dump(x) (void(0))

#endif

template<typename T> using V = vector<T>;

template<typename T> using P = pair<T, T>;

using ll = long long;

using ld = long double;

using Vi = V<int>;  using VVi = V<Vi>;

using Vl = V<ll>;   using VVl = V<Vl>;

using Vd = V<ld>;   using VVd = V<Vd>;

using Vb = V<bool>; using VVb = V<Vb>;

using Pi = P<int>;

using Pl = P<ll>;

using Pd = P<ld>;

template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;

template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }

template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }

template<typename T> inline int sz(T &x) { return x.size(); }

template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }

template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }

template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }

template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)

inline ll cDiv(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)

inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))

inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))

inline int popcount(const ll x) { return __builtin_popcountll(x); }

inline void fail() { cout << -1 << '\n'; exit(0); }

struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

// const int INF  = 1<<30;

// const ll INFll = 1ll<<60;

// const ld EPS   = 1e-10;

// const ld PI    = acos(-1.0);

const int MOD  = int(1e9)+7;

// const int MOD  = 998244353;





template<int MOD> struct ModInt {

  int x;

  ModInt(ll _x = 0) : x( (0 <= _x && _x < MOD) ? _x : (_x%MOD+MOD)%MOD ) {}

  constexpr int &value() noexcept { return x; }

  constexpr ModInt operator-() const noexcept { return ModInt(MOD-x); }

  constexpr ModInt operator+(const ModInt y) const noexcept { return ModInt(*this) += y; }

  constexpr ModInt operator-(const ModInt y) const noexcept { return ModInt(*this) -= y; }

  constexpr ModInt operator*(const ModInt y) const noexcept { return ModInt(*this) *= y; }

  constexpr ModInt operator/(const ModInt y) const noexcept { return ModInt(*this) /= y; }

  constexpr ModInt &operator+=(const ModInt y) noexcept { x += y.x; if (x >= MOD) x -= MOD; return *this; }

  constexpr ModInt &operator-=(const ModInt y) noexcept { x -= y.x; if (x < 0) x += MOD; return *this; }

  constexpr ModInt &operator*=(const ModInt y) noexcept { x = ll(x) * y.x % MOD; return *this; }

  constexpr ModInt &operator/=(const ModInt y) {

    int a = y.x, b = MOD, u = 1, v = 0;

    while (b) {

      int t = a / b;

      a -= t * b; swap(a, b);

      u -= t * v; swap(u, v);

    }

    x = ll(x) * u % MOD;

    if (x < 0) x += MOD;

    return *this;

  }

  constexpr ModInt pow(ll n) const noexcept {

    ModInt x(1);

    ModInt a = *this;

    for (; n > 0; n >>= 1, a *= a) if (n&1) x *= a;

    return x;

  }

};

using mint = ModInt<MOD>;

using Vm = vector<mint>;

using VVm = vector<Vm>;

using VVVm = vector<VVm>;

// istream &operator>>(istream &is, mint &a) { return is >> a.x; }

ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }





struct Factorial {

  int MAX;

  vector<mint> fac, finv;

  Factorial(int M = 1) : MAX(M), fac(M, 1), finv(M, 1) {

    rep2(i, 2, MAX) fac[i] = fac[i-1] * i;

    finv[MAX-1] /= fac[MAX-1];

    drep2(i, MAX, 3) finv[i-1] = finv[i] * i;

  }

};

Factorial fc;



mint binom(int n, int k) {

  if (k < 0 || n < k) return 0;

  return fc.fac[n] * fc.finv[k] * fc.finv[n-k];

}



mint perm(int n, int k) {

  if (k < 0 || n < k) return 0;

  return fc.fac[n] * fc.finv[n-k];

}





VVi G;



struct ReRooting {

  // edit area begin

  struct DP {

    mint a;

    int b;

    DP(mint _a = 1, int _b = 0) : a(_a), b(_b) {}

  };

  DP f_merge(DP x, DP y) {

    return {x.a * y.a * binom(x.b + y.b, x.b), x.b + y.b};

  }

  DP f_trans(DP x) {

    return {x.a, x.b + 1};

  }

  // edit area end



  vector<vector<DP>> dp;

  vector<DP> ans;

  vector<int> p_idx;



  ReRooting(int N) : dp(N), ans(N), p_idx(N) {}



  DP dfs(int u, int p=-1) {

    int d = G[u].size();

    dp[u] = vector<DP>(d);

    DP res;

    rep(i, d) {

      int v = G[u][i];

      if (v == p) {

        p_idx[u] = i;

        continue;

      }

      dp[u][i] = dfs(v, u);

      res = f_merge(res, dp[u][i]);

    }

    return f_trans(res);

  }



  void dfs2(int u, int p=-1) {

    int d = G[u].size();

    vector<DP> l(d+1), r(d+1);

    rep(i, d)  l[i+1] = f_merge(l[i], dp[u][i]);

    drep(i, d) r[i] = f_merge(r[i+1], dp[u][i]);

    ans[u] = l[d];

    rep(i, d) {

      int v = G[u][i];

      if (v == p) continue;

      dp[v][p_idx[v]] = f_trans(f_merge(l[i], r[i+1]));

      dfs2(v, u);

    }

  }



  void build() {

    dfs(0);

    dfs2(0);

  }

};





int main() {

  int n; cin >> n;

  fc = Factorial(n);



  G.assign(n, Vi());

  rep(i, n-1) {

    int u, v; cin >> u >> v;

    u--; v--;

    G[u].push_back(v);

    G[v].push_back(u);

  }



  ReRooting reroot(n);

  reroot.build();



  rep(i, n) cout << reroot.ans[i].a << endl;

  return 0;

}

// Fastest known solution for this problem: