#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
#define MOD 1000000007
template<int mod>
struct ModInt{
	int x;
	ModInt():x(0){}
	ModInt(long long y):x(y>=0?y%mod:(mod-(-y)%mod)%mod){}
	ModInt &operator+=(const ModInt &p){
		if((x+=p.x)>=mod)x-=mod;
		return *this;
	}
	ModInt &operator-=(const ModInt &p){
		if((x+=mod-p.x)>=mod)x-=mod;
		return *this;
	}
	ModInt &operator*=(const ModInt &p){
		x=(int)(1LL*x*p.x%mod);
		return *this;
	}
	ModInt &operator/=(const ModInt &p){
		*this*=p.inverse();
		return *this;
	}
	ModInt &operator^=(long long p){
		ModInt res = 1;
		for (; p; p >>= 1) {
			if (p & 1) res *= *this;
			*this *= *this;
		}
		return *this = res;
	}
	ModInt operator-()const{return ModInt(-x);}
	ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
	ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
	ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
	ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
	ModInt operator^(long long p)const{return ModInt(*this)^=p;}
	bool operator==(const ModInt &p)const{return x==p.x;}
	bool operator!=(const ModInt &p)const{return x!=p.x;}
	explicit operator int() const { return x; }						   // added by QCFium
	ModInt operator=(const int p) {x = p; return ModInt(*this);} // added by QCFium
	ModInt inverse()const{
		int a=x,b=mod,u=1,v=0,t;
		while(b>0){
			t=a/b;
			a-=t*b;
			std::swap(a,b);
			u-=t*v;
			std::swap(u,v);
		}
		return ModInt(u);
	}
	friend std::ostream &operator<<(std::ostream &os,const ModInt<mod> &p){
		return os<<p.x;
	}
	friend std::istream &operator>>(std::istream &is,ModInt<mod> &a){
		long long x;
		is>>x;
		a=ModInt<mod>(x);
		return (is);
	}
};
typedef ModInt<MOD> mint;

struct MComb {
	std::vector<mint> fact;
	std::vector<mint> inversed;
	MComb(int n) { // O(n+log(mod))
		fact = std::vector<mint>(n+1,1);
		for (int i = 1; i <= n; i++) fact[i] = fact[i-1]*mint(i);
		inversed = std::vector<mint>(n+1);
		inversed[n] = fact[n] ^ (MOD-2);
		for (int i = n - 1; i >= 0; i--) inversed[i]=inversed[i+1]*mint(i+1);
	}
	mint ncr(int n, int r) {
		return (fact[n] * inversed[r] * inversed[n-r]);
	}
	mint npr(int n, int r) {
		return (fact[n] * inversed[n-r]);
	}
	mint nhr(int n, int r) {
		assert(n+r-1 < (int)fact.size());
		return ncr(n+r-1, r);
	}
};

MComb com(200001);

struct Stuff {
	int cnt;
	mint num;
	Stuff operator * (const Stuff &rhs) {
		return {cnt + rhs.cnt, num * rhs.num / com.fact[cnt] * com.fact[cnt + rhs.cnt] / com.fact[rhs.cnt]};
	}
};

std::vector<std::vector<int> > hen;
std::vector<Stuff> subtree;
std::vector<Stuff> parent;

void dfs1(int i, int prev) {
	if (prev != -1) hen[i].erase(std::find(hen[i].begin(), hen[i].end(), prev));
	Stuff all = {0, 1};
	for (auto j : hen[i]) {
		dfs1(j, i);
		all = all * subtree[j];
	}
	all.cnt++;
	subtree[i] = all;
}
void dfs2(int i) {
	int m = hen[i].size();
	std::vector<Stuff> left = { {0, 1} }, right = { {0, 1} };
	for (int j = 0; j < m - 1; j++) left.push_back(left.back() * subtree[hen[i][j]]);
	for (int j = m - 1; j > 0; j--) right.push_back(right.back() * subtree[hen[i][j]]);
	std::reverse(right.begin(), right.end());
	
	for (int j = 0; j < m; j++) {
		parent[hen[i][j]] = left[j] * right[j] * parent[i];
		parent[hen[i][j]].cnt++;
		dfs2(hen[i][j]);
	}
}

int main() {
	int n = ri();
	hen.resize(n);
	for (int i = 1; i < n; i++) {
		int a = ri() - 1;
		int b = ri() - 1;
		hen[a].push_back(b);
		hen[b].push_back(a);
	}
	subtree.resize(n); 
	dfs1(0, -1);
	parent.resize(n);
	parent[0] = {0, 1};
	dfs2(0);
	for (int i = 0; i < n; i++) {
		Stuff all = parent[i];
		// std::cerr << parent[i].cnt << " " << parent[i].num << std::endl;
		for (auto j : hen[i]) all = all * subtree[j];
		std::cout << all.num << std::endl;
	}
	return 0;
}


Measured memory_bytes: 22000