#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>

#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#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 IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
/* const int MOD = 998244353; */
const int INF = 1e18;
const double PI = acos(-1);

using namespace std;
struct INIT { INIT(){
  cin.tie(0); ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
}}INIT;

struct mint {
  int val;
  mint(int v = 0) noexcept : val(v % MOD) {
    if (val < 0) val += MOD;
  }
  int getMOD() { return MOD; }
  mint operator - () const noexcept {
    return val ? MOD - val : 0;
  }
  mint operator + (const mint& r) const noexcept { return mint(*this) += r; }
  mint operator - (const mint& r) const noexcept { return mint(*this) -= r; }
  mint operator * (const mint& r) const noexcept { return mint(*this) *= r; }
  mint operator / (const mint& r) const noexcept { return mint(*this) /= r; }
  mint& operator += (const mint& r) noexcept {
    val += r.val;
    if (val >= MOD) val -= MOD;
    return *this;
  }
  mint& operator -= (const mint& r) noexcept {
    val -= r.val;
    if (val < 0) val += MOD;
    return *this;
  }
  mint& operator *= (const mint& r) noexcept {
    val = val * r.val % MOD;
    return *this;
  }
  mint& operator /= (const mint& r) noexcept {
    int a = r.val, b = MOD, u = 1, v = 0;
    while (b) {
      int t = a / b;
      a -= t * b; swap(a, b);
      u -= t * v; swap(u, v);
    }
    val = val * u % MOD;
    if (val < 0) val += MOD;
    return *this;
  }
  bool operator == (const mint& r) const noexcept {
    return this->val == r.val;
  }
  bool operator != (const mint& r) const noexcept {
    return this->val != r.val;
  }
  friend ostream& operator << (ostream &os, const mint& x) noexcept {
    return os << x.val;
  }
  friend istream& operator >> (istream &is, mint& x) noexcept {
    return is >> x.val;
  }
  friend mint powMod(const mint &a, int n) noexcept {
    if (n == 0) return 1;
    auto t = powMod(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
  }
};

const int MAX_N = 200005;

struct combination {
  vector<mint> fac, finv, inv;

  combination(int n) {
    fac  = vector<mint>(n, 1);
    finv = vector<mint>(n, 1);
    inv  = vector<mint>(n, 1);
    for (int i = 2; i < n; i++) {
      fac[i] = fac[i - 1] * i;
      inv[i] = - inv[MOD % i] * (MOD / i);
      finv[i] = finv[i - 1] * inv[i];
    }
  }

  mint operator()(int n, int k) {
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * finv[k] * finv[n - k];
  }
}comb(MAX_N);

struct DP {
  mint dp;
  int t;
  DP(mint dp = 1, int t = 0): dp(dp), t(t) {}
  DP operator + (const DP& a) const {
    return DP(dp*a.dp*comb(t+a.t, t), t+a.t);
  }
  DP operator - (const DP& a) const {
    return DP(dp/a.dp/comb(t, a.t), t-a.t);
  }
  DP addRoot() const {
    return DP(dp, t+1);
  }
};

vector<DP> dpSum(MAX_N);
vector<vector<DP>> dp(MAX_N);
vector<vector<int>> graph(MAX_N);

DP dfs(int v, int p = -1){
  dp[v] = vector<DP>(graph[v].size());
  REP(i, graph[v].size()){
    int u = graph[v][i];
    if(u == p) continue;
    dp[v][i] = dfs(u, v);
    dpSum[v] = dpSum[v]+dp[v][i];
  }
  return dpSum[v].addRoot();
}
void bfs(int v, const DP& dpP = DP(), int p = -1){
  if(p != -1) dpSum[v] = dpSum[v]+dpP;
  REP(i, graph[v].size()){
    int u = graph[v][i];
    if(u == p) continue;
    DP d = dpSum[v]-dp[v][i];
    bfs(u, d.addRoot(), v);
  }
}

signed main() {
  int N; 
  cin >> N;

  REP(i, N-1){
    int u, v;
    cin >> u >> v;
    u--; v--;
    graph[u].emplace_back(v);
    graph[v].emplace_back(u);
  }

  dfs(0);
  bfs(0);

  REP(i, N){
    cout << dpSum[i].addRoot().dp << "\n";
  }

  return 0;
}

Measured memory_bytes: 36592