#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) ((x).begin(), (x).end())
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;

constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;

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

/*-------------------------------------------*/

template <int M> class ModInt {
    int x;

  public:
    constexpr ModInt() : x(0) {}
    constexpr ModInt(int64_t y) : x(y >= 0 ? y % M : (M - (-y) % M) % M) {}
    constexpr ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= M) x -= M;
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt &p) {
        if((x += M - p.x) >= M) x -= M;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % M);
        return *this;
    }
    constexpr ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
    constexpr ModInt operator-() const { return ModInt(-x); }
    constexpr ModInt operator+(const ModInt &p) const {
        return ModInt(*this) += p;
    }
    constexpr ModInt operator-(const ModInt &p) const {
        return ModInt(*this) -= p;
    }
    constexpr ModInt operator*(const ModInt &p) const {
        return ModInt(*this) *= p;
    }
    constexpr ModInt operator/(const ModInt &p) const {
        return ModInt(*this) /= p;
    }
    constexpr bool operator==(const ModInt &p) const { return x == p.x; }
    constexpr bool operator!=(const ModInt &p) const { return x != p.x; }
    constexpr ModInt inverse() const {
        int a = x, b = M, u = 1, v = 0, t = 0;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }
    constexpr ModInt pow(const int64_t &n) const {
        ModInt ret(1), mul(x);
        int64_t k = n % (M - 1);
        if(k < 0) k += M - 1;
        while(k > 0) {
            if(k & 1) ret *= mul;
            mul *= mul;
            k >>= 1;
        }
        return ret;
    }
    constexpr friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }
    constexpr friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t = 0;
        is >> t;
        a = ModInt(t);
        return (is);
    }
};
using modint = ModInt<mod>;

// 組み合わせ、階乗逆元
vector<modint> fact, fact_inv;

void COMinit(const ll &MAX) {
    fact.resize(MAX + 1);
    fact_inv.resize(MAX + 1);
    fact[0] = 1;
    rep(i, MAX) fact[i + 1] = fact[i] * (i + 1);
    fact_inv[MAX] = fact[MAX].inverse();
    for(int i = MAX; i; i--)
        fact_inv[i - 1] = fact_inv[i] * i;
}

modint COM(const ll &n, const ll &k) {
    if(n < k || k < 0) return 0;
    return fact[n] * fact_inv[k] * fact_inv[n - k];
}

int n;
V<V<int>> G;
V<int> sz;
V<modint> mo;
V<modint> ans;

void dfs1(int i, int p) {
    sz[i] = 1;
    mo[i] = 1;
    for(int e : G[i]) {
        if(e != p) {
            dfs1(e, i);
            sz[i] += sz[e];
            mo[i] *= mo[e];
        }
    }
    int sum = sz[i] - 1;
    for(int e : G[i]) {
        if(e != p) {
            mo[i] *= COM(sum, sz[e]);
            sum -= sz[e];
        }
    }
}

void dfs2(int i, int p) {
    if(p == -1) {
        for(int e : G[i])
            dfs2(e, i);
        return;
    }
    modint x = ans[p];
    x /= COM(n - 1, sz[i]);
    x /= mo[i];
    ans[i] = mo[i] * x * COM(n - 1, n - sz[i]);
    for(int e : G[i])
        if(e != p) dfs2(e, i);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    cin >> n;
    COMinit(n);
    G.resize(n);
    mo.resize(n);
    sz.resize(n);
    ans.resize(n);
    rep(i, n - 1) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs1(0, -1);
    ans[0] = mo[0];
    dfs2(0, -1);

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

    return 0;
}

Measured memory_bytes: 18432