#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

const int MOD_TYPE = 1;
const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const ld PI = acos(-1.0);
const ld EPS = 1e-11;

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;

vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

template <int MOD>
struct Fp
{
  long long val;

  constexpr Fp(long long v = 0) noexcept : val(v % MOD)
  {
    if (val < 0)
      v += MOD;
  }

  constexpr int getmod()
  {
    return MOD;
  }

  constexpr Fp operator-() const noexcept
  {
    return val ? MOD - val : 0;
  }

  constexpr Fp operator+(const Fp &r) const noexcept
  {
    return Fp(*this) += r;
  }

  constexpr Fp operator-(const Fp &r) const noexcept
  {
    return Fp(*this) -= r;
  }

  constexpr Fp operator*(const Fp &r) const noexcept
  {
    return Fp(*this) *= r;
  }

  constexpr Fp operator/(const Fp &r) const noexcept
  {
    return Fp(*this) /= r;
  }

  constexpr Fp &operator+=(const Fp &r) noexcept
  {
    val += r.val;
    if (val >= MOD)
      val -= MOD;
    return *this;
  }

  constexpr Fp &operator-=(const Fp &r) noexcept
  {
    val -= r.val;
    if (val < 0)
      val += MOD;
    return *this;
  }

  constexpr Fp &operator*=(const Fp &r) noexcept
  {
    val = val * r.val % MOD;
    return *this;
  }

  constexpr Fp &operator/=(const Fp &r) noexcept
  {
    long long a = r.val, b = MOD, u = 1, v = 0;
    while (b)
    {
      long long 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;
  }

  constexpr bool operator==(const Fp &r) const noexcept
  {
    return this->val == r.val;
  }

  constexpr bool operator!=(const Fp &r) const noexcept
  {
    return this->val != r.val;
  }

  friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept
  {
    return os << x.val;
  }

  friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept
  {
    return is >> x.val;
  }
};

Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept
{
  if (n == 0)
    return 1;
  auto t = modpow(a, n / 2);
  t = t * t;
  if (n & 1)
    t = t * a;
  return t;
}

using mint = Fp<MOD>;

template <class T>
struct BiCoef
{
  vector<T> fact_, inv_, finv_;

  constexpr BiCoef()
  {
  }

  constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1)
  {
    init(n);
  }

  constexpr void init(int n) noexcept
  {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    int MOD = fact_[0].getmod();
    for (int i = 2; i < n; i++)
    {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }

  constexpr T C(int n, int k) const noexcept
  {
    if (n < k || n < 0 || k < 0)
      return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }

  constexpr T P(int n, int k) const noexcept
  {
    return C(n, k) * fact_[k];
  }

  constexpr T H(int n, int k) const noexcept
  {
    return C(n + k - 1, k);
  }

  constexpr T fact(int n) const noexcept
  {
    if (n < 0)
      return 0;
    return fact_[n];
  }

  constexpr T inv(int n) const noexcept
  {
    if (n < 0)
      return 0;
    return inv_[n];
  }

  constexpr T finv(int n) const noexcept
  {
    if (n < 0)
      return 0;
    return finv_[n];
  }
};

BiCoef<mint> bc(200010);

template <typename T>
struct ReRooting
{
  using F1 = function<T(T)>;
  using F2 = function<T(T, T)>;
  static const int MAX_V = 200010;
  int V;
  vector<int> E[MAX_V];
  vector<T> dp[MAX_V];
  //遷移：dp[vの子]にfを作用させてmergeでまとめた後、gを作用させる
  F1 f, g;
  F2 merge;
  T mi; //mergeの単位元
  int root;
  T hoge; //dfs2で使う用、何でもよい

  ReRooting(int V_, F1 f_, F2 merge_, T mi_, F1 g_ = [](T a) { return a; }, T hoge_ = 0) : V(V_), f(f_), merge(merge_), mi(mi_), g(g_), hoge(hoge_) {}

  void add_E(int a, int b)
  {
    E[a].push_back(b);
    E[b].push_back(a);
  }

  //上から下
  T dfs1(int p, int v)
  {
    T res = mi;
    rep(i, E[v].size())
    {
      if (E[v][i] == p)
        continue;
      dp[v][i] = dfs1(v, E[v][i]);
      res = merge(res, f(dp[v][i]));
    }

    return g(res);
  }

  //下から上
  void dfs2(int p, int v, T add)
  {
    //上から持ってきた値を清算
    rep(i, E[v].size())
    {
      if (E[v][i] == p)
      {
        dp[v][i] = add;
        break;
      }
    }

    //左右からの累積を作っておく
    vector<T> pL(E[v].size() + 1), pR(E[v].size() + 1);
    pL[0] = mi;
    rep(i, E[v].size()) pL[i + 1] = merge(pL[i], f(dp[v][i]));
    pR[E[v].size()] = mi;
    for (int i = E[v].size(); i > 0; --i)
      pR[i - 1] = merge(pR[i], f(dp[v][i - 1]));

    rep(i, E[v].size())
    {
      if (E[v][i] == p)
        continue;
      T val = merge(pL[i], pR[i + 1]);
      dfs2(v, E[v][i], g(val));
    }
  }

  void calc(int root = 0)
  {
    rep(i, V) dp[i].resize(E[i].size());
    dfs1(-1, root);
    dfs2(-1, root, hoge);
  }

  T solve(int v)
  {
    T ans = mi;
    rep(i, E[v].size())
    {
      ans = merge(ans, f(dp[v][i]));
    }
    return g(ans);
  }
};

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);

  ll n;
  cin >> n;
  using P = pair<mint, ll>;
  auto f = [&](P p) {
    P res;
    res.first = p.first * bc.finv(p.second);
    res.second = p.second;
    return res;
  };
  auto merge = [&](P a, P b) {
    P res;
    res.first = a.first * b.first;
    res.second = a.second + b.second;
    return res;
  };
  auto g = [&](P a) {
    P res;
    res.second = a.second + 1;
    res.first = a.first * bc.fact(res.second - 1);
    return res;
  };
  ReRooting<P> re(n, f, merge, MP((mint)1, 0), g, MP(1, 0));
  rep(i, n - 1)
  {
    int a, b;
    cin >> a >> b;
    a--, b--;
    re.add_E(a, b);
  }
  re.calc();
  rep(v, n) cout << re.solve(v).first << endl;
  return 0;
}


Measured memory_bytes: 39040