#include <bits/stdc++.h>
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

namespace math {

template <typename T>
constexpr T pow(const T &n, ll k) {
    T ret = n.mul_id_ele();
    T cur = n;
    while (k) {
        if (k & 1) ret *= cur;
        cur *= cur;
        k /= 2;
    }
    return ret;
}

}

namespace math {

template <ll Mod>
struct Modint {

    constexpr Modint(ll x) : x((Mod + x % Mod) % Mod) { }
    
    constexpr Modint() : Modint(0) { }
    
    constexpr Modint<Mod> add_id_ele() const { 
        return Modint<Mod>(0); 
    }
    
    constexpr Modint<Mod> mul_id_ele() const {
        return Modint<Mod>(1); 
    }
    
    constexpr ll& value() { 
        return x; 
    }
    
    constexpr ll value() const {
        return x; 
    }

    constexpr Modint& operator +=(const Modint &oth) {
        x += oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }

    constexpr Modint& operator -=(const Modint &oth) {
        x += Mod - oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }

    constexpr Modint& operator *=(const Modint &oth) {
        x *= oth.value();
        x %= Mod;
        return *this;
    }

    constexpr Modint& operator /=(const Modint &oth) {
        x *= oth.inv();
        x %= Mod;
        return *this;
    }

    constexpr Modint operator +(const Modint &oth) const {
        return Modint(x) += oth;
    }

    constexpr Modint operator -(const Modint &oth) const {
        return Modint(x) -= oth;
    }

    constexpr Modint operator *(const Modint &oth) const {
        return Modint(x) *= oth;
    }

    constexpr Modint operator /(const Modint &oth) const {
        return Modint(x) /= oth;
    }

    constexpr Modint operator -() const {
        return Modint((x != 0) * (Mod - x)); 
    }

    template <typename T>
    constexpr typename std::enable_if<std::is_integral<T>::value, const Modint&>::type
    operator =(T t) {
        (*this) = Modint(std::forward<T>(t)); 
        return *this;
    }

    constexpr Modint inv() const {
        return ::math::pow(*this, Mod - 2);
    }

    constexpr ll mod() const {
        return Mod;
    }

private:
    ll x;
};

}

namespace math {

template <ll Mod>
class Combination {
    using mint = Modint<Mod>;

    ssize_t maxv;
    vec<mint> factv, ifactv;

public:
    Combination(ssize_t maxv) : maxv(maxv), factv(maxv + 1), ifactv(maxv + 1) {
        factv[0] = mint(1);
        for (ll i = 1; i <= maxv; i++) factv[i] = factv[i - 1] * i;
        ifactv.back() = factv.back().inv();
        for (ll i = maxv - 1; 0 <= i; i--) ifactv[i] = ifactv[i + 1] * (i + 1);
    }

    mint fact(ll n) const {
        return factv[n]; 
    }

    mint ifact(ll n) const {
        return ifactv[n];
    }

    mint perm(ll n, ll k) const {
        return factv[n] * ifactv[n - k];
    }

    mint comb(ll n, ll k) const {
        return perm(n, k) * ifactv[k];
    }
};

}

namespace graph {

using Node = ll;
using Weight = ll;
using Edge = std::pair<Node, Weight>;

template <bool Directed>
struct Graph : public vvec<Edge> {
    using vvec<Edge>::vvec;

    void add_edge(Node f, Node t, Weight w = 1) {
        (*this)[f].emplace_back(t, w);
        if (!Directed) (*this)[t].emplace_back(f, w);
    }

    Graph<Directed> build_inv() const {
        Graph<Directed> ret(this->size());
        for (Node i = 0; i < this->size(); i++) {
            for (const Edge &e : (*this)[i]) {
                Node j;
                Weight w;
                std::tie(j, w) = e;
                if (!Directed && j < i) continue;
                ret.add_edge(j, i, w);
            }
        }

        return ret;
    }
};

template <typename Iterator>
class dst_iterator {
    Iterator ite;

public:
    dst_iterator(Iterator ite) : ite(ite) { }

    bool operator ==(const dst_iterator<Iterator> &oth) const {
        return ite == oth.ite;
    }

    bool operator !=(const dst_iterator<Iterator> &oth) const {
        return !(*this == oth);
    }

    bool operator <(const dst_iterator<Iterator> &oth) const {
        return ite < oth.ite;
    }

    bool operator >(const dst_iterator<Iterator> &oth) const {
        return ite > oth.ite;
    }

    bool operator <=(const dst_iterator<Iterator> &oth) const {
        return ite <= oth.ite;
    }

    bool operator >=(const dst_iterator<Iterator> &oth) const {
        return ite >= oth.ite;
    }

    const Node& operator *() {
        return ite->first;
    }

    const Node& operator *() const {
        return ite->first;
    }

    dst_iterator operator ++() {
        ++ite;
        return ite;
    }
};

class dst_iteration {
    using ite_type = vec<Edge>::const_iterator;
    const vec<Edge> &edges;

public:
    dst_iteration(const vec<Edge> &edges) : edges(edges) { }

    auto begin() const {
        return dst_iterator<ite_type>(edges.cbegin());
    }

    auto end() const {
        return dst_iterator<ite_type>(edges.cend());
    }
};

dst_iteration dst(const vec<Edge> &edges) {
    return dst_iteration(edges);
}

}

const ll mod = 1e9 + 7;
using mint = math::Modint<mod>;
math::Combination<mod> co(1e6);
using dp_type = std::pair<mint, ll>;
vec<dp_type> dp;
vec<mint> ans;

dp_type dfs(ll cur, ll pre, const graph::Graph<false> &g) {
    mint fst = 1, div = 1;
    ll snd = 1;
    for (ll nxt : graph::dst(g[cur])) {
        if (nxt == pre) continue;
        auto res = dfs(nxt, cur, g);
        fst *= res.first;
        snd += res.second;
        div *= co.ifact(res.second);
    }
    fst *= div;
    fst *= co.fact(snd - 1);
    return dp[cur] = std::make_pair(fst, snd);
}

dp_type merge(dp_type a, dp_type b) {
    mint c, d;
    ll e, f;
    std::tie(c, e) = a;
    std::tie(d, f) = b;
    return std::make_pair(c * d, e + f);
}

void dfs2(ll cur, ll pre, dp_type pval, const graph::Graph<false> &g) {
    mint mul = 1, div = 1;
    for (ll nxt : graph::dst(g[cur])) {
        auto res = (pre == nxt ? pval : dp[nxt]);
        mul *= res.first;
        div *= co.ifact(res.second);
    }
    ans[cur] = mul * div * co.fact(g.size() - 1);
    
    vec<dp_type> lch(g[cur].size() + 1), rch(g[cur].size() + 1);
    lch.front() = rch.back() = dp_type(mint(1), 0);
    for (ll i = 0; i < g[cur].size(); i++) {
        ll nxt = g[cur][i].first;
        auto val = (nxt == pre ? pval : dp[nxt]);
        lch[i + 1] = merge(lch[i], val);
        lch[i + 1].first *= co.ifact(val.second);
    }
    for (ll i = g[cur].size() - 1; 0 <= i; i--) {
        ll nxt = g[cur][i].first;
        auto val = (nxt == pre ? pval : dp[nxt]);
        rch[i] = merge(rch[i + 1], val);
        rch[i].first *= co.ifact(val.second);
    }

    for (ll i = 0; i < g[cur].size(); i++) {
        ll nxt = g[cur][i].first;
        if (nxt == pre) continue;
        auto lv = lch[i], rv = rch[i + 1];
        auto pv = merge(lv, rv);
        pv.first *= co.fact(pv.second);
        pv.second++;
        dfs2(nxt, cur, pv, g);
    }
}

int main() {
    ll n;
    std::cin >> n;
    graph::Graph<false> g(n);
    for (ll i = 1; i < n; i++) {
        ll a, b;
        std::cin >> a >> b;
        g.add_edge(a - 1, b - 1);
    }
    dp.resize(n);
    ans.resize(n);

    dfs(0, -1, g);
    dfs2(0, -1, dp_type(), g);
    for (auto &&e : ans) std::cout << e.value() << '\n';
    return 0;
}


Measured memory_bytes: 41836