#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using uint = unsigned int;
using ull = unsigned long long;

template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;

constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
constexpr int mod2 = 998244353;
template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return (a > b && (a = b, true)); }
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return (a < b && (a = b, true)); }
template<typename T>
bool isin(T y, T x, T h, T w) { return (0 <= y && 0 <= x && y < h && x < w); }
template<typename T>
bool isin1(T y, T x, T h, T w) { return (0 < y && 0 < x && y <= h && x <= w); }

template<typename T>
ostream& operator <<(ostream &os, vector<T> &v) {
	os << v[0];
	for (int i = 1; i < v.size(); i++) os << " " << v[i];
	return (os);
}

template<typename T>
istream& operator >>(istream &is, vector<T> &v) {
	for (auto &u : v) is >> u; return (is);
}

template<typename T1, typename T2>
istream& operator >>(istream &is, pair<T1, T2> &p) {
	return (is >> p.first >> p.second);
}

template<unsigned MOD>
class Modint {
	public:
		using uint = unsigned;
		using u64 = uint64_t;
		using i64 = int64_t;

		Modint (const i64 dat = 0) : dat(dat >= 0 ? dat % MOD : (MOD - (-dat) % MOD) % MOD) {}

		constexpr Modint operator + (const Modint &v) const { return (Modint(dat + v.dat)); }
		constexpr Modint operator - () const { return (Modint(-((i64)dat))); }
		constexpr Modint operator - (const Modint &v) const { return ((*this) + -v); }
		constexpr Modint operator * (const Modint &v) const { return (Modint((u64)dat * v.dat)); }

		constexpr Modint operator ~ () const {
			i64 a = dat, b = MOD, x1 = 1, x2 = 0, t;

			while (b > 0) {
				t = a / b;
				swap(a -= t * b, b);
				swap(x1 -= t * x2, x2);
			}

			return (Modint(x1));
		}

		constexpr Modint operator / (const Modint &v) const { return ((*this) * ~v); }

		Modint &operator = (const i64 &v) { return ((*this) = Modint < MOD > (v)); }
		Modint &operator += (const Modint &v) { return ((*this) = (*this) + v); }
		Modint &operator -= (const Modint &v) { return ((*this) = (*this) - v); }
		Modint &operator *= (const Modint &v) { return ((*this) = (*this) * v); }
		Modint &operator /= (const Modint &v) { return ((*this) = (*this) / v); }

		constexpr Modint operator ^ (u64 n) const {
			Modint<MOD> ret(1), mul(dat);
			while (n > 0) {
				if (n & 1) ret *= mul;
				mul *= mul;
				n >>= 1;
			}
			return (ret);
		}

		bool operator == (const Modint &v) { return (dat == v.dat); }
		bool operator != (const Modint &v) { return (dat != v.dat); }

		friend ostream& operator << (ostream &os, const Modint &p) {
			return (os << p.dat);
		}

		friend istream& operator >> (istream &is, Modint &p) {
			i64 data;
			is >> data;
			p = Modint<MOD>(data);
			return (is);
		}

	private:
		uint dat;
};

int N;
vvint G;

vector<Modint<mod>> par, fct;
vector<Modint<mod>> ans;
vint size;

void dfs1(int u, int p) {
	par[u] = 1;
	size[u] = 0;
	for (auto &v : G[u]) {
		if (v != p) {
			dfs1(v, u);
			par[u] *= par[v] / fct[size[v]];
			size[u] += size[v];
		}
	}
	par[u] *= fct[size[u]];
	size[u]++;
}

void dfs2(int u, Modint<mod> d_par, int d_size, int p) {
	for (auto &v : G[u]) {
		if (v == p) {
			if (d_size > 0) ans[u] *= d_par / fct[d_size];
		} else {
			ans[u] *= par[v] / fct[size[v]];
		}
	}
	ans[u] *= fct[N-1];

	for (auto &v : G[u]) {
		Modint<mod> ndpar = ans[u];
		if (v != p) {
			ndpar /= (fct[N-1] / (fct[size[v]] * fct[N-1-size[v]]) * par[v]);
			dfs2(v, ndpar, N-size[v], u);
		}
	}
}

void Main() {
	cin >> N;
	G = vvint(N);
	par = vector<Modint<mod>>(N);
	fct = vector<Modint<mod>>(N+1, 1);
	ans = vector<Modint<mod>>(N, 1);

	size = vint(N);
	for (int i = 2; i <= N; i++) {
		fct[i] *= fct[i-1] * i;
	}
	for (int i = 0; i < N-1; i++) {
		int a, b; cin >> a >> b; --a, --b;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	dfs1(0, -1);
	dfs2(0, 1, 0, -1);
	for (int i = 0; i < N; i++) {
		cout << ans[i] << el;
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout << fixed << setprecision(20);
	Main();
	return (0);
}


Measured memory_bytes: 17140