#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class T> istream& operator>>(istream& is,vector<T>& v) { for(T& t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream& os,const vector<T>& v) { for(T t:v){os<<t<<" ";} os<<"\n"; return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

const int mod = 1000000007;
struct mint {
  ll x;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this;}
  mint& operator++() { x += 1; return *this;}
  mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; }
  mint& operator--() { x -= 1; return *this;}
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
  mint operator+(const mint a) const { mint res(*this); return res+=a; }
  mint operator-(const mint a) const { mint res(*this); return res-=a; }
  mint operator*(const mint a) const { mint res(*this); return res*=a; }
  bool operator==(const int n) const { mint a(n); return this->x == a.x; }
  bool operator==(const ll n) const { mint a(n); return this->x == a.x; }
  bool operator!=(const int n) const { mint a(n); return this->x != a.x; }
  bool operator!=(const ll n) const { mint a(n); return this->x != a.x; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  // for prime mod
  mint inv() const { return pow(mod-2); }
  mint& operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const { mint res(*this); return res/=a; }
};
istream& operator>>(istream& is,const mint& m) { return is >> m.x; }
ostream& operator<<(ostream& os,const mint& m) { return os << m.x; }

class combination {
  vector<mint> fact, ifact;
public:
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
} comb(200100);

template<typename T> // monoid
class rerooting {
    int n;
    vvi tree;
    T identity;
    function<T(T,T)> merge;
    function<T(T)> addRoot;
    vector<vector<T>> dp;
    vector<T> ans;

    T dfs(int v = 0,int p = -1) {
        T sum = identity;
        dp[v].resize(tree[v].size());
        rep(i,tree[v].size()) {
            int u = tree[v][i];
            if(u == p) continue;
            dp[v][i] = dfs(u,v);
            sum = merge(sum,dp[v][i]);
        }
        return addRoot(sum);
    }
    void dfs2(T dpP,int v = 0,int p = -1) {
        int sz = tree[v].size();
        rep(i,sz) if(tree[v][i] == p) dp[v][i] = dpP;
        vector<T> sumL(sz+1,identity),sumR(sz+1,identity);
        rep(i,sz) sumL[i+1] = merge(sumL[i],dp[v][i]);
        rrep(i,sz) sumR[i] = merge(sumR[i+1],dp[v][i]);
        ans[v] = addRoot(sumL[sz]);
        rep(i,sz) {
            int u = tree[v][i];
            if(u == p) continue;
            T t = merge(sumL[i],sumR[i+1]);
            dfs2(addRoot(t),u,v);
        }
    }
    void init() {
        dfs();
        dfs2(identity);
    }

public:
    rerooting(int n,vvi tree,T identity,function<T(T,T)> merge,function<T(T)> addRoot)
            :n(n),tree(tree),identity(identity),merge(merge),addRoot(addRoot),dp(n),ans(n) {
        init();
    };
    T get_ans(int i) {
        assert(0 <= i && i < n);
        return ans[i];
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int n;
    cin >> n;
    vvi tree(n);
    rep(_,n-1) {
        int a,b;
        cin >> a >> b;
        a--; b--;
        tree[a].pb(b);
        tree[b].pb(a);
    }
    using mp = pair<mint,int>;
    auto f = [](mp a,mp b)->mp {
        mint m = a.first*b.first*comb(a.second+b.second,a.second);
        return mp(m,a.second+b.second);
    };
    auto g = [](mp m) {
        return mp(m.first,m.second+1);
    };
    rerooting<mp> rt(n,tree,{mint(1),0},f,g);
    rep(i,n) cout << rt.get_ans(i).first << endl;
}


Measured memory_bytes: 62068