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

#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long

const int MOD = 1000000007;

struct mint {
    int val;
 
    mint(int v = 0) {
        val = v % MOD;
        if(val < 0) val += MOD;
    }
 
    static int mod_inv(int a, int m = MOD) {
        int g = m, r = a, x = 0, y = 1;
 
        while (r != 0) {
            int q = g / r;
            g %= r; swap(g, r);
            x -= q * y; swap(x, y);
        }
 
        return x < 0 ? x + m : x;
    }
 
    explicit operator int() const {
        return val;
    }
 
    mint& operator+=(const mint &other) {
        val += other.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
 
    mint& operator-=(const mint &other) {
        val -= other.val;
        if (val < 0) val += MOD;
        return *this;
    }
 
    mint& operator*=(const mint &other) {
        val = ((uint64_t) val*other.val)%MOD;
        return *this;
    }
 
    mint& operator/=(const mint &other) {
        return *this *= other.inv();
    }
 
    friend mint operator+(const mint &a, const mint &b) { return mint(a) += b; }
    friend mint operator-(const mint &a, const mint &b) { return mint(a) -= b; }
    friend mint operator*(const mint &a, const mint &b) { return mint(a) *= b; }
    friend mint operator/(const mint &a, const mint &b) { return mint(a) /= b; }
 
    mint& operator++() {
        val = val == MOD - 1 ? 0 : val + 1;
        return *this;
    }
 
    mint& operator--() {
        val = val == 0 ? MOD - 1 : val - 1;
        return *this;
    }
 
    mint operator++(int32_t) { mint before = *this; ++*this; return before; }
    mint operator--(int32_t) { mint before = *this; --*this; return before; }
 
    mint operator-() const {
        return val == 0 ? 0 : MOD - val;
    }
 
    bool operator==(const mint &other) const { return val == other.val; }
    bool operator!=(const mint &other) const { return val != other.val; }
 
    mint inv() const {
        return mod_inv(val);
    }
 
    mint pow(int p) const {
        mint a = *this, result = 1;
 
        while (p > 0) {
            if (p & 1)
                result *= a;
 
            a *= a;
            p >>= 1;
        }
 
        return result;
    }
 
    friend ostream& operator<<(ostream &stream, const mint &m) {
        return stream << m.val;
    }
};

const int N = 200009;
int n;
vector<int> graph[N];

int d[N];
mint ans, an[N];

void dfs1(int cur, int par = 0) {
    d[cur]++;
    for(int child : graph[cur]) {
        if(child == par) continue;
        dfs1(child, cur);
        d[cur] += d[child];
    }
}

void dfs(int cur, int par = 0) {
    an[cur] = ans;
    for(int child : graph[cur]) {
        if(child == par) continue;
        int dc = d[child];
        int new_cur = d[cur] - dc;
        ans *= dc;
        ans /= new_cur;
        d[child] = n;
        d[cur] = new_cur;
        dfs(child, cur);
        d[child] = dc;
        d[cur] = n;
        ans *= new_cur;
        ans /= dc;
    }
}

int32_t main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 0; i < n-1; ++i) {
        int a, b; cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    dfs1(1);

    ans = 1;
    for(int i = 1; i < n; ++i) {
        ans *= i;
    }
    
    for(int i = 2; i <= n; ++i) {
        ans /= d[i];
    }
    
    dfs(1);
    
    for(int i = 1; i <= n; ++i) {
        cout << an[i] << '\n';
    }
    
    return 0;
}


Measured memory_bytes: 17904