#include <bits/stdc++.h>
       
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
class ModInt {
  static int MOD;
  long long x;

 public:
  static void mod(int m) { MOD = m; }

  ModInt(long long v = 0) : x(v % MOD) {
    if (x < 0) x += MOD;
  }

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

  ModInt& operator-=(const ModInt& r) {
    x -= r.x;
    if (x < 0) x += MOD;
    return *this;
  }
  ModInt& operator*=(const ModInt& r) {
    x = (x * r.x) % MOD;
    return *this;
  }
  ModInt& operator/=(const ModInt& r) {
    *this *= r.inverse();
    return *this;
  }

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

  ModInt operator+(const ModInt& r) const { return ModInt(*this) += r; }
  ModInt operator-(const ModInt& r) const { return ModInt(*this) -= r; }
  ModInt operator*(const ModInt& r) const { return ModInt(*this) *= r; }
  ModInt operator/(const ModInt& r) const { return ModInt(*this) /= r; }
  bool operator==(const ModInt& r) const { return x == r.x; }
  bool operator!=(const ModInt& r) const { return x != r.x; }

  ModInt inverse() const {
    long long 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(long long n) const {
    if (n < 0) return pow(-n).inverse();

    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream& operator<<(ostream& os, const ModInt& x) { return os << x.x; }

  friend istream& operator>>(istream& is, ModInt& x) { return is >> x.x; }

  int getMod() { return MOD; }

  long long val() { return x; }
};
int ModInt::MOD = 1000000007;
       
template <typename T>
class Combination {
  vector<T> fact, ifact;

 public:
  Combination(int nMax) : fact(nMax + 1), ifact(nMax + 1) {
    fact[0] = 1;
    for (int i = 0; i < nMax; ++i) fact[i + 1] = fact[i] * (i + 1);
    for (int i = 0; i < nMax + 1; ++i) ifact[i] = fact[i].inverse();
  }

  T factorial(int n) const { return fact[n]; }
  T inverseFactorial(int n) const { return ifact[n]; }

  T P(int n, int k) const {
    if (n < 0 || k < 0 || n < k) return 0;
    return factorial(n) * inverseFactorial(n - k);
  }

  T C(int n, int k) const {
    if (n < 0 || k < 0 || n < k) return 0;
    return factorial(n) * inverseFactorial(n - k) * inverseFactorial(k);
  }

  T H(int n, int k) const {
    if (n < 0 || k < 0) return 0;
    return k == 0 ? 1 : C(n + k - 1, k);
  }
};
template <typename Result, typename Product>
class ReRooting {
  int V;
  vector<vector<int>> G;
  vector<vector<Product>> lpMemo, rpMemo;
  vector<unordered_map<int, int>> id;
  function<Product(Product, Result)> reduce;
  function<Result(int, Product, Product)> treeValue;
  Product uninitialized;
  function<Product(int)> identity;
  Product leftProduct(int u, int endIndex) {
    if (endIndex == 0) return identity(u);
    if (lpMemo[u][endIndex] != uninitialized) return lpMemo[u][endIndex];

    return lpMemo[u][endIndex] = reduce(leftProduct(u, endIndex - 1),
                                        value(G[u][endIndex - 1], u));
  }
  Product rightProduct(int u, int endIndex) {
    if (endIndex == G[u].size() - 1) return identity(u);
    if (rpMemo[u][endIndex] != uninitialized) return rpMemo[u][endIndex];

    return rpMemo[u][endIndex] = reduce(rightProduct(u, endIndex + 1),
                                        value(G[u][endIndex + 1], u));
  }

 public:
  ReRooting(const vector<vector<int>> &G,
            const function<Product(Product, Result)> &reduce,
            const function<Result(int, Product, Product)> &treeValue,
            const function<Product(int)> &identity, Product uninitialized)
      : G(G),
        V(G.size()),
        treeValue(treeValue),
        reduce(reduce),
        uninitialized(uninitialized),
        identity(identity) {
    id.resize(V);
    lpMemo.resize(V), rpMemo.resize(V);

    for (int u = 0; u < V; ++u) {
      for (int i = 0; i < G[u].size(); ++i) {
        id[u][G[u][i]] = i;
      }

      lpMemo[u].resize(G[u].size() + 1, uninitialized);
      rpMemo[u].resize(G[u].size() + 1, uninitialized);
    }
  }
  Result value(int u, int p) {
    if (p == -1) return treeValue(u, leftProduct(u, G[u].size()), identity(u));

    return treeValue(u, leftProduct(u, id[u][p]), rightProduct(u, id[u][p]));
  }
};

struct State {
  int c;
  ModInt m;
  bool operator!=(const State& that) { return c != that.c || m != that.m; }
};

int main() {
  int N;
  cin >> N;
  vector<vector<int>> G(N);
  Combination<ModInt> comb(N);

  for (int i = 0; i < (int)(N - 1); ++i) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    G[a].push_back(b);
    G[b].push_back(a);
  }

  ReRooting<State, State> rr(
      G,
      [&](State a, State e) {
        return State{a.c + e.c, a.m * e.m / comb.factorial(e.c)};
      },
      [&](int i, State lp, State rp) {
        return State{lp.c + rp.c + 1,
                     lp.m * rp.m * comb.factorial(lp.c + rp.c)};
      },
      [](int i) {
        return State{0, 1};
      },
      State{-1, 0});

  for (int i = 0; i < (int)(N); ++i) cout << rr.value(i, -1).m << endl;

  return 0;
}


Measured memory_bytes: 112024