#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma warning(disable : 4996)
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
#include<array>


using namespace std;

#define REP(i, n) for(int i = 0;i < n;++i)
#define REPR(i, n) for(int i = n-1;i >= 0;--i)
#define FOR(i, m, n) for(int i = m;i < n;++i)
#define FORR(i, m, n) for(int i = m-1;i >= n;--i)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout<<(x)<<'\n'
#define pe(x) cout<<(x)<<" "
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define lb(v,n) lower_bound(v.begin(), v.end(), (n))
#define ub(v,n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i,v.size())cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template<typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int>P;
typedef array<int, 3> arr3;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9+7; constexpr int MAX = 2000020;
const double pi = acos(-1); constexpr double EPS = 1e-8;
constexpr ll INF = 1e18;
void y(bool cond){
	if (cond)print("Yes");
	else print("No");
}


// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
constexpr int mod = 1000000007;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
	mint operator+(const mint a) const { return mint(*this) += a; }
	mint operator-(const mint a) const { return mint(*this) -= a; }
	mint operator*(const mint a) const { return mint(*this) *= a; }
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const { return pow(mod - 2); }
	mint& operator/=(const mint a) { return *this *= a.inv(); }
	mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

mint fac[200020];
vector<int>G[200020];
mint dp[200020];
int siz[200020];
void init() {
	fac[0] = 1;
	FOR(i, 1, 200020) {
		fac[i] = fac[i - 1] * i;
	}
}
int N;
mint facall[200020];
mint divi[200020];
mint dfs(int n, int pre) {
	mint res = 1;
	int sum = 0;
	divi[n] = fac[N - 1];
	facall[n] = 1;
	for (auto nxt : G[n]) {
		if (nxt == pre)continue;
		res *= dfs(nxt, n);
		sum += siz[nxt];
		res /= fac[siz[nxt]];
		divi[n] /= fac[siz[nxt]];
		facall[n] *= fac[siz[nxt]];
	}
	divi[n] /= fac[N - siz[n]];
	facall[n] *= fac[N - siz[n]];
	res *= fac[sum];
	return dp[n] = res;
}
int calc_siz(int n, int pre) {
	int res = 1;
	for (auto nxt : G[n]) {
		if (nxt == pre)continue;
		res += calc_siz(nxt, n);
	}
	return siz[n] = res;
}
mint dp_all[200020];

void calc_all(int n, int par) {
	if (n == 0) {
		dp_all[n] = dp[n];
		for (auto nxt : G[n])calc_all(nxt, n);
	}
	else {
		//pe(par + 1); pe(facall[par]); print(divi[par]);
		mint resp = dp_all[par] / dp[n];
		resp /= divi[par];
		resp *= fac[N - 1 - siz[n]] / (facall[par] / fac[siz[n]]);
		//resp /= fac[N - 1];
		//resp *= fac[N - 1 - siz[n]];
		mint res = resp;
		for (auto chi : G[n]) {
			if (chi == par)continue;
			res *= dp[chi];
			res /= fac[siz[chi]];
		}
		res *= fac[N - 1];
		res /= fac[N - siz[n]];
		dp_all[n] = res;
		for (auto chi : G[n]) {
			if (chi == par)continue;
			calc_all(chi, n);
		}
	}
}
void solve() {
	cin >> N;
	REP(i, N - 1) {
		int u, v; cin >> u >> v;
		u--, v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	init();
	calc_siz(0, 0);
	dfs(0, 0);
	calc_all(0, 0);
	REP(i, N) {
		//DEBUG(dp[i]);
		print(dp_all[i]);
	}
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q; cin >> q;
	//while (q--)
	solve();
}




Measured memory_bytes: 24960