//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")*/
//#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define dab(v) for(auto i:v)cout<<i<<' ';
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ld EPS = 0.001;
const ld EPS2 = 1e-6;
const ld PI = acos(-1);
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int a228 = 18;
const int inf = 1e9;
const ll kekmod = 1791791791;
const ll bestmod = 1148822869;
const int MAXN = 2e5 + 1;
#define int ll
int binpow(int a, int b)
{
	int res = 1;
	while (b)
	{
		if (b & 1)
		{
			res = (res * a) % MOD7;
		}
		a = (a * a) % MOD7;
		b >>= 1;
	}
	return res;
}
int inv(int a)
{
	return binpow(a, MOD7 - 2);
}
vector<vector<int>> g(MAXN);
vector<int> sz(MAXN);
int n;

vector<int> dpdown(MAXN);
vector<int> pr(MAXN);
vector<int> dpup(MAXN);
vector<int> dp(MAXN);
vector<int> fc(MAXN);
void dfs(int v, int p)
{
	sz[v] = 1;
	pr[v] = p;
	dpdown[v] = 1;
	for (int i : g[v])
	{
		if (i != p)
		{
			dfs(i, v);
			sz[v] += sz[i];
			dpdown[v] = (dpdown[v] * dpdown[i])% MOD7;
			dpdown[v] *= inv(fc[sz[i]]);
			dpdown[v] %= MOD7;
		}
	}
	dpdown[v] *= fc[sz[v] - 1];
	 dpdown[v] %= MOD7;
}
void dfsup(int v, int p)
{
	if (v == p) dpup[v] = 1;
	dp[v] =inv(fc[sz[v] -1]) * dpdown[v] % MOD7 * dpup[v] % MOD7 * inv(fc[n - sz[v]]) % MOD7;
	for (int i : g[v])
	{
		if (i != p)
		{
			int now = dp[v];
			now *= inv(dpdown[i]);
			now %= MOD7;
			now *= fc[sz[i]];
			now %= MOD7;
			now *= fc[n - sz[i] -1];
			now %= MOD7;
			dpup[i] = now;
			dfsup(i, v);
		}
	}
	dp[v] *= fc[n - 1];
	dp[v] %= MOD7;
}
signed main()
{
	fastio();
	fc[0] = 1;
	for (int i = 1; i < MAXN; ++i)
	{
		fc[i] = fc[i - 1] * i % MOD7;
	}
	cin >> n;
	for (int i = 0; i < n - 1; ++i)
	{
		int a, b;
		cin >> a >> b;
		g[a].pbc(b);
		g[b].pbc(a);
	}
	dfs(1, 1);
	dfsup(1, 1);
	for (int i = 1; i <= n; ++i)
	{
		cout << dp[i] << endl;
	}
	//sp;
}

Measured memory_bytes: 24064