#include <bits/stdc++.h>
using namespace std;

template <int mod = (int)(1e9 + 7)>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y)
      : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const {
    return ModInt(*this) += p;
  }
  ModInt operator-(const ModInt &p) const {
    return ModInt(*this) -= p;
  }
  ModInt operator*(const ModInt &p) const {
    return ModInt(*this) *= p;
  }
  ModInt operator/(const ModInt &p) const {
    return ModInt(*this) /= p;
  }
  bool operator==(const ModInt &p) const {
    return x == p.x;
  }
  bool operator!=(const ModInt &p) const {
    return x != p.x;
  }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt res(1), mul(x);
    while(n) {
      if(n & 1) res *= mul;
      mul *= mul;
      n >>= 1;
    }
    return res;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};

struct Combination {
  vector<ModInt<>> _fact, _rfact, _inv;
  Combination(long long nsize = 5000000)
      : _fact(nsize + 1), _rfact(nsize + 1),
        _inv(nsize + 1) {
    _fact[0] = _rfact[nsize] = _inv[0] = 1;
    for(int i = 1; i <= nsize; i++)
      _fact[i] = _fact[i - 1] * i;
    _rfact[nsize] /= _fact[nsize];
    for(int i = nsize - 1; i >= 0; i--)
      _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= nsize; i++)
      _inv[i] = _rfact[i] * _fact[i - 1];
  }
  inline ModInt<> fact(int k) const { return _fact[k]; }

  inline ModInt<> rfact(int k) const { return _rfact[k]; }

  inline ModInt<> inv(int k) const { return _inv[k]; }

  ModInt<> P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  ModInt<> C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }
  ModInt<> H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 0 : C(n + r - 1, r - 1);
  }
};
long long n;
vector<vector<int>> edges;
vector<long long> cnt;
vector<ModInt<>> dp, res;
vector<bool> used;
Combination com;

void solve();
void dfs(int now);
void reroot(int now);

int main() {
  cin >> n;
  edges.resize(n);
  for(int i = 0; i < n - 1; ++i) {
    int a, b;
    cin >> a >> b;
    edges[--a].push_back(--b);
    edges[b].push_back(a);
  }
  solve();
  for(auto p : res) cout << p << endl;
  return 0;
}

void solve() {
  cnt.assign(n, 0);
  dp.assign(n, 1);
  res.assign(n, 0);
  used.assign(n, 0);
  used[0] = 1;
  dfs(0);
  used.assign(n, 0);
  used[0] = 1;
  reroot(0);
}

void dfs(int now) {
  for(auto to : edges[now])
    if(!used[to]) {
      used[to] = 1;
      dfs(to);
      dp[now] *= com.rfact(cnt[to]);
      dp[now] *= dp[to];
      cnt[now] += cnt[to];
    }
  dp[now] *= com.fact(cnt[now]);
  ++cnt[now];
}

void reroot(int now) {
  long long bfcnt = cnt[now];
  ModInt<> bfdp = dp[now];
  dp[now] = 1;
  cnt[now] = 0;
  for(auto to : edges[now]) {
    dp[now] *= com.rfact(cnt[to]);
    dp[now] *= dp[to];
    cnt[now] += cnt[to];
  }
  dp[now] *= com.fact(cnt[now]);
  res[now] = dp[now];
  long long all = cnt[now] + 1;
  ModInt<> tmp = dp[now] / com.fact(cnt[now]);
  for(auto to : edges[now])
    if(!used[to]) {
      dp[now] = tmp / dp[to];
      dp[now] /= com.rfact(cnt[to]);
      cnt[now] = all - cnt[to];
      dp[now] *= com.fact(cnt[now] - 1);
      used[to] = 1;
      reroot(to);
    }
  dp[now] = bfdp;
  cnt[now] = bfcnt;
}

Measured memory_bytes: 75636