#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, MOD = 1e9 + 7;
struct edge
{
	int v, nxt;
}e[N * 2];
int p[N], eid;
int res[N],sz[N];
bool vst[N];
int n;

void add(int u, int v)
{
	e[eid] = edge{v, p[u]}; p[u] = eid ++;
}
int pow_mod(int a, int b)
{
	long long res = 1, tmp = a;
	for (; b; b /= 2)
	{
		if(b & 1) res = res * tmp % MOD;
		tmp = tmp * tmp % MOD;
	}
	return res;
}
void dfs1(int u)
{
	vst[u] = 1;
	sz[u] = 1;
	
	for (int i = p[u]; ~i; i = e[i].nxt)
	{
		int v = e[i].v;
		if(vst[v]) continue;
		dfs1(v);
		sz[u] += sz[v];
	}
	res[1] = (1LL * res[1] * u) % MOD;
	res[1] = (1LL * res[1] * pow_mod(sz[u], MOD - 2)) % MOD;
}
void dfs2(int u)
{
	vst[u] = 1;
	for (int i = p[u]; ~i; i = e[i].nxt)
	{
		int v = e[i].v;
		if(vst[v]) continue;
		res[v] = 1LL * res[u] * sz[v] % MOD * pow_mod(n - sz[v], MOD - 2) % MOD;
		dfs2(v);
	}
}
int main()
{
	scanf("%d", &n);
	memset(p, -1, sizeof(p));
	for (int i = 1; i < n; ++ i)
	{
		int u ,v; scanf("%d%d", &u, &v);
		add(u, v);
		add(v, u);
	}
	res[1] = 1;
	dfs1(1);
	memset(vst, 0, sizeof(vst));
	dfs2(1);
	for (int i = 1; i <= n; ++ i) printf("%d\n", res[i]);
	return 0;
}