#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define lbd(a, x) lower_bound(all(a), x)
const int mod = 1e9 + 7;
int power_mod(int a, int b) {
	int res = 1;
	for(; b; b >>= 1, a = (ll) a * a % mod)
		if(b & 1) res = (ll) res * a % mod;
	return res;
}
const int N = 2e5 + 10;
vector<int> E[N];
int fac[N], ifac[N];
int C(int n, int m) {
	return (ll) fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int dp[N], sz[N], n;
void dfs1(int u, int pre) {
	dp[u] = sz[u] = 1;
	for(auto &v : E[u]) {
		if(v == pre) continue;
		dfs1(v, u);
		sz[u] += sz[v];
		dp[u] = (ll) dp[u] * dp[v] % mod * ifac[sz[v]] % mod;
	}
	dp[u] = (ll) dp[u] * fac[sz[u] - 1] % mod;
}
int up[N];
void dfs2(int u, int pre) {
	for(auto &v : E[u]) {
		if(v == pre) continue;
		up[v] = (ll) dp[u] * power_mod(dp[v], mod - 2) % mod;
		up[v] = (ll) up[v] * power_mod(C(n - 1, sz[v]), mod - 2) % mod;
		dp[v] = (ll) dp[v] * C(n - 1, sz[v] - 1) % mod;
		dp[v] = (ll) dp[v] * up[v] % mod;
		dfs2(v, u);
	}
}
int main() {
#ifdef local
	freopen("in.txt", "r", stdin);
#endif
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	fac[0] = ifac[0] = 1;
	for(int i = 1; i < N; i++) fac[i] = (ll) fac[i - 1] * i % mod;
	ifac[N - 1] = power_mod(fac[N - 1], mod - 2);
	for(int i = N - 2; i; i--) ifac[i] = (ll) ifac[i + 1] * (i + 1) % mod;
	cin >> n;
	for(int i = 1, u, v; i < n; i++) {
		cin >> u >> v;
		E[u].push_back(v);
		E[v].push_back(u);
	}
	dfs1(1, 0);
	dfs2(1, 0);
	for(int i = 1; i <= n; i++) {
		cout << dp[i] << '\n';
	}
	return 0;
}
