#include<bits/stdc++.h>
#define m 1000000007
#define r(i,n) for(l i=0;i<n;i++)
#define B push_back
using namespace std;
typedef long l;
typedef vector<l> L;
vector<L> p;
l P(l i, l b) {l a=1;r(n,62){if((b>>n)%2){a*=p[i][n];a%=m;}}return a;}
int main(){deque<l>q;l N,X,Y;cin>>N;l M=N-1;L V,A(N,0),a(N,-1),D(N,1),J(N,0),n(N,1),w(70);vector<L>T(N);
	r(i,N*2){w[0]=i;r(j,62)w[j+1]=(w[j]*w[j])%m;p.B(w);}
	r(i,M){cin>>X>>Y;X--;Y--;T[X].B(Y);T[Y].B(X);A[X]++;A[Y]++;	}q.B(0);J[0]=1;V.B(0);
	r(k,N){l x=q.front();q.pop_front();r(i,A[x]){l E=T[x][i];if(!J[E]){J[E]=1;	q.B(E);a[E]=x;V.B(E);}}}
	r(j,N){l i=N-1-j,x=V[i];r(j,A[x]){l E=T[x][j];if(E==a[x])continue;D[x]+=D[E];}}
	r(i,N)n[0]=((n[0]*(i+1)%m)*P(D[i],m-2))%m;
	r(j,N-1){l x=V[j+1];n[x]=(((n[a[x]]*D[x])%m)*P(N-D[x],m-2))%m;}
	r(i,N)cout<<n[i]<<"\n";}