#include <bits/stdc++.h>

typedef long long ll;

const ll kMod = 1e9 + 7;
const int kN = 2e5 + 5;

ll QPow(ll a, ll b) {
	ll ans = 1, bas = a % kMod;
	while(b) {
		if(b & 1) ans = ans * bas % kMod;
		bas = bas * bas % kMod;
		b >>= 1;
	}
	return ans;
}

std::vector<int> E[kN];
int n, siz[kN], fa[kN]; ll f[kN];
void Dfs1(int x) {
	f[x] = 1; siz[x] = 1;
	for(int i : E[x])
		if(!siz[i]) {
			Dfs1(i); siz[x] += siz[i]; fa[i] = x;
			f[x] = f[x] * f[i] % kMod;
		}
	f[x] = f[x] * siz[x] % kMod;
}
void Dfs2(int x) {
	for(int i : E[x])
		if(i != fa[x]) {
			f[i] = f[x] * (n - siz[i]) % kMod * QPow(siz[i], kMod - 2) % kMod;
			Dfs2(i);
		}
}

int main() {
	scanf("%d", &n);
	ll fac = 1;
	for(int i = 1; i <= n; ++i) fac = fac * i % kMod;
	for(int i = 1; i < n; ++i) {
		int a, b; scanf("%d%d", &a, &b);
		E[a].push_back(b); E[b].push_back(a);
	}
	Dfs1(1); Dfs2(1);
	for(int i = 1; i <= n; ++i)
		printf("%lld\n", fac * QPow(f[i], kMod - 2) % kMod);
	return 0;
}