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

using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();

//==================================

template <std::int_fast64_t Modulus>
class ModInt {
    using i64 = std::int_fast64_t;

    // friend
    template <std::int_fast64_t _MOD>
    friend std::istream& operator>>(std::istream& is, ModInt<_MOD>& rhs);
    template <std::int_fast64_t _MOD>
    friend std::ostream& operator<<(std::ostream& os, const ModInt<_MOD>& rhs);

private:
    i64 m_value;

public:
    /**
     * コンストラクタ
     */
    constexpr ModInt(const i64 x = 0) noexcept : m_value(x % Modulus) {
        if (m_value < 0) m_value += Modulus;
    }

    constexpr const i64& value() const noexcept { return m_value; }

    constexpr ModInt operator+(const ModInt& rhs) const noexcept {
        return ModInt(*this) += rhs;
    }
    constexpr ModInt operator-(const ModInt& rhs) const noexcept {
        return ModInt(*this) -= rhs;
    }
    constexpr ModInt operator*(const ModInt& rhs) const noexcept {
        return ModInt(*this) *= rhs;
    }
    constexpr ModInt operator/(const ModInt& rhs) const noexcept {
        return ModInt(*this) /= rhs;
    }

    constexpr ModInt& operator+=(const ModInt rhs) noexcept {
        m_value += rhs.m_value;
        if (m_value >= Modulus) {
            m_value -= Modulus;
        }
        return *this;
    }
    constexpr ModInt& operator-=(const ModInt rhs) noexcept {
        if (m_value < rhs.m_value) {
            m_value += Modulus;
        }
        m_value -= rhs.m_value;
        return *this;
    }
    constexpr ModInt& operator*=(const ModInt rhs) noexcept {
        m_value = m_value * rhs.m_value % Modulus;
        return *this;
    }
    constexpr ModInt& operator/=(ModInt rhs) noexcept {
        i64 exp = Modulus - 2;
        while (exp) {
            if (exp & 1) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp >>= 1;
        }
        return *this;
    }

    constexpr ModInt& operator++() noexcept {
        *this += 1;
        return *this;
    }
    constexpr ModInt operator++(int) noexcept {
        ModInt res = *this;
        *this += 1;
        return res;
    }
    constexpr ModInt& operator--() noexcept {
        *this -= 1;
        return *this;
    }
    constexpr ModInt operator--(int) noexcept {
        ModInt res = *this;
        *this -= 1;
        return res;
    }

    constexpr bool operator<(const ModInt& rhs) const noexcept {
        return m_value < rhs.m_value;
    }
    constexpr bool operator>(const ModInt& rhs) const noexcept {
        return m_value > rhs.m_value;
    }
    constexpr bool operator<=(const ModInt& rhs) const noexcept {
        return m_value <= rhs.m_value;
    }
    constexpr bool operator>=(const ModInt& rhs) const noexcept {
        return m_value >= rhs.m_value;
    }
    constexpr bool operator==(const ModInt& rhs) const noexcept {
        return m_value == rhs.m_value;
    }

    constexpr ModInt pow(i64 k) const noexcept {
        ModInt res = 1;
        ModInt tmp = *this;
        for (; k > 0; k >>= 1) {
            if (k & 1) res *= tmp;
            tmp *= tmp;
        }
        return res;
    }

    constexpr ModInt inverse() const noexcept {
        i64 q = m_value;
        i64 b = Modulus, u = 1, v = 0;
        while (b) {
            i64 t = q / b;
            q -= t * b;
            swap(q, b);
            u -= t * v;
            swap(u, v);
        }
        u %= Modulus;
        if (u < 0) u += Modulus;
        return u;
    }
};

// iostream用の関数[ModInt]
template <std::int_fast64_t Modulus>
std::istream& operator>>(std::istream& is, ModInt<Modulus>& rhs) {
    is >> rhs.m_value;
    return is;
}
template <std::int_fast64_t Modulus>
std::ostream& operator<<(std::ostream& os, const ModInt<Modulus>& rhs) {
    os << rhs.m_value;
    return os;
}

template <std::int_fast64_t Modulus>
class ModComb {
    using i64 = int_fast64_t;
    using Vl = std::vector<i64>;

private:
    Vl fac, inv, finv;

public:
    ModComb(i64 n) : fac(n + 1), inv(n + 1), finv(n + 1) {
        fac[0] = fac[1] = 1;
        finv[0] = finv[1] = 1;
        inv[1] = 1;
        for (i64 i = 2; i < n + 1; ++i) {
            fac[i] = fac[i - 1] * i % Modulus;
            inv[i] = Modulus - inv[Modulus % i] * (Modulus / i) % Modulus;
            finv[i] = finv[i - 1] * inv[i] % Modulus;
        }
    }

    ModInt<Modulus> comb(i64 n, i64 k) {
        ModInt<Modulus> res;
        if (n < k)
            res = 0;
        else if (n < 0 || k < 0)
            res = 0;
        else
            res = fac[n] * (finv[n - k] * finv[k] % Modulus) % Modulus;
        return res;
    }

    ModInt<Modulus> get_fac(i64 n) { return ModInt<Modulus>(fac[n]); }
    ModInt<Modulus> get_finv(i64 n) { return ModInt<Modulus>(finv[n]); }
};


constexpr ll MOD = 1e9 + 7;
using Mint = ModInt<MOD>;
using Graph = vector<Vi>;

Mint dp[200010];
int psize[200010];
ModComb<MOD> mc(200010);
Mint ans[200010];

Graph g;
int N;


int main() {
#ifdef FASTIO
    cin.tie(0), cout.tie(0);
    ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    ifstream ifs("./in_out/input.txt");
    cin.rdbuf(ifs.rdbuf());
#endif

    cin >> N;
    g.resize(N);
    for (int i = 0; i < N - 1; i++) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    fill_n(psize, sizeof(psize) / sizeof(psize[0]), -1);

    // par, psize, dpを計算する
    stack<Pii> stk1;  // { 自分, 親 }
    stk1.emplace(0, -1);
    while (!stk1.empty()) {
        int idx, par;
        tie(idx, par) = stk1.top();

        bool goback = true;  // 帰りがけなら true

        for (const auto& to : g[idx]) {
            if (to == par) continue;
            if (psize[to] == -1) {
                stk1.emplace(to, idx);
                goback = false;
            }
        }

        if (goback) {
            psize[idx] = 1;
            dp[idx] = 1;
            for (const auto& to : g[idx]) {
                if (to == par) continue;
                psize[idx] += psize[to];
                dp[idx] *= dp[to] * mc.get_finv(psize[to]);
            }
            dp[idx] *= mc.get_fac(psize[idx] - 1);
            stk1.pop();
        }
    }

    // 全方位木DP
    stack<tuple<int, int, Mint>> stk2;
    stk2.emplace(0, -1, 0);  // { 自分, 親, 親の値}
    while (!stk2.empty()) {
        int idx, par;
        Mint d_par;
        tie(idx, par, d_par) = stk2.top();
        stk2.pop();  // 帰りがけはないのでここで捨ててしまおう

        ans[idx] = 1;
        if (par != -1) {
            ans[idx] *= d_par * mc.get_finv(N - 1) / (dp[idx] * mc.get_finv(psize[idx])) * mc.get_fac(N - psize[idx] - 1);
            ans[idx] *= mc.get_finv(N - psize[idx]);
        }
        ans[idx] *= dp[idx] * mc.get_finv(psize[idx] - 1) * mc.get_fac(N - 1);

        for (const auto& to : g[idx]) {
            if (to == par) continue;
            stk2.emplace(to, idx, ans[idx]);
        }
    }

    for (int i = 0; i < N; i++) {
        cout << ans[i] << '\n';
    }

    return 0;
}


Measured memory_bytes: 24996