using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
 
namespace AtCoder
{
	public class Program
	{
		static void Main()
		{
			var cin = new Scanner();
			int n = cin.Int();
 
			ModCounting.InitializeFactorial(n);
 
			var reroot = new Rerooting<Virtex>(
				n,
				(x, y) => {
					int count = x.Count + y.Count;
					ModInt combination = ModCounting.Factorial(count)
						* x.Combination
						* y.Combination
						* ModCounting.InverseFactorial(x.Count)
						* ModCounting.InverseFactorial(y.Count);
					return new Virtex { Count = count, Combination = combination };
				},
				x => {
					return new Virtex { Count = x.Count + 1, Combination = x.Combination };
				},
				new Virtex { Count = 0, Combination = 1 });
 
			for (int i = 0; i < n - 1; i++) {
				int a = cin.Int() - 1;
				int b = cin.Int() - 1;
				reroot.AddEdge(a, b);
				reroot.AddEdge(b, a);
			}
 
			var ans = reroot.Build();
			var sb = new StringBuilder();
			for (int i = 0; i < n; i++) {
				sb.AppendLine(ans[i].Combination.ToString());
			}
 
			Console.Write(sb.ToString());
		}
 
		struct Virtex
		{
			public int Count { get; set; }
			public ModInt Combination { get; set; }
		}
	}
 
	public class Rerooting<T>
	{
		private readonly int n_;
		private readonly Func<T, T, T> merge_;
		private readonly Func<T, T> create_;
		private readonly T unit_;
		private readonly List<int>[] to_;
		private readonly T[][] dp_;
		private readonly T[] result_;
		private int[] reverseIndexes_;
 
		public Rerooting(
			int n,
			Func<T, T, T> merge,
			Func<T, T> create,
			T unit)
		{
			n_ = n;
			merge_ = merge;
			create_ = create;
			unit_ = unit;
 
			to_ = new List<int>[n];
			dp_ = new T[n][];
			result_ = new T[n];
			for (int i = 0; i < n; i++) {
				to_[i] = new List<int>();
				result_[i] = unit_;
			}
		}
 
		public void AddEdge(int a, int b)
		{
			to_[a].Add(b);
		}
 
		public T[] Build(int root = 0, bool doseOnlyTreeDp = false)
		{
			DfsForTreeDP(root);
			if (doseOnlyTreeDp == false) {
				BfsForReroot(root);
			}
 
			return result_;
		}
 
		private void DfsForTreeDP(int v, int p = -1)
		{
			{
				var parents = new int[n_];
				var indexes = new int[n_];
				reverseIndexes_ = new int[n_];
				var visited = new bool[n_];
				var routeStack = new Stack<int>(n_);
				var tempStack = new Stack<int>(n_);
				routeStack.Push(v);
				tempStack.Push(v);
				visited[v] = true;
				parents[v] = -1;
 
				while (tempStack.Count > 0) {
					int current = tempStack.Pop();
					dp_[current] = new T[to_[current].Count];
					for (int i = 0; i < to_[current].Count; i++) {
						int next = to_[current][i];
						if (visited[next]) {
							reverseIndexes_[current] = i;
							continue;
						}
 
						visited[next] = true;
						parents[next] = current;
						indexes[next] = i;
						routeStack.Push(next);
						tempStack.Push(next);
					}
				}
 
				while (routeStack.Count > 0) {
					int target = routeStack.Pop();
					T accum = unit_;
					if (parents[target] >= 0) {
						for (int i = 0; i < to_[target].Count; i++) {
							int child = to_[target][i];
							if (child == parents[target]) {
								continue;
							}
 
							accum = merge_(accum, dp_[target][i]);
						}
 
						result_[target] = create_(accum);
						dp_[parents[target]][indexes[target]] = result_[target];
					}
				}
			}
		}
 
		private void BfsForReroot(int first)
		{
			int max = 0;
			for (int i = 0; i < n_; i++) {
				max = Math.Max(max, to_[i].Count);
			}
 
			var accumL = new T[max + 1];
			var accumR = new T[max + 1];
 
			var q = new Queue<BfsInfo>(n_);
			q.Enqueue(new BfsInfo(first, -1));
			while (q.Count > 0) {
				var current = q.Dequeue();
				int count = to_[current.V].Count;
 
				accumL[0] = unit_;
				for (int i = 0; i < count; i++) {
					accumL[i + 1] = merge_(accumL[i], dp_[current.V][i]);
				}
 
				accumR[count] = unit_;
				for (int i = count - 1; i >= 0; i--) {
					accumR[i] = merge_(accumR[i + 1], dp_[current.V][i]);
				}
 
				result_[current.V] = create_(accumL[count]);
 
				for (int i = 0; i < count; i++) {
					int next = to_[current.V][i];
					if (next == current.P) {
						continue;
					}
 
					T reverse = create_(merge_(accumL[i], accumR[i + 1]));
					dp_[next][reverseIndexes_[next]] = reverse;
 
					q.Enqueue(new BfsInfo(next, current.V));
				}
			}
		}
 
		private struct BfsInfo
		{
			public int V { get; set; }
			public int P { get; set; }
 
			public BfsInfo(int v, int p)
			{
				V = v;
				P = p;
			}
		}
	}
 
	public struct ModInt
	{
		public static long P { get; set; } = (long)1e9 + 7;
 
		public static ModInt Pow(ModInt value, long k)
		{
			return Pow(value.Value, k);
		}
 
		public static ModInt Pow(long value, long k)
		{
			long ret = 1;
			for (k %= P - 1; k > 0; k >>= 1, value = value * value % P) {
				if ((k & 1) == 1) {
					ret = ret * value % P;
				}
			}
			return new ModInt(ret);
		}
 
		public static ModInt Inverse(ModInt value)
		{
			return Pow(value, P - 2);
		}
 
		public long Value;
 
		public ModInt(long value)
		{
			value %= P;
			if (value < 0) {
				value += P;
			}
 
			Value = value;
		}
 
		public static ModInt operator +(ModInt lhs, ModInt rhs)
		{
			lhs.Value += rhs.Value;
			if (lhs.Value >= P) {
				lhs.Value -= P;
			}
			return lhs;
		}
 
		public static ModInt operator -(ModInt lhs, ModInt rhs)
		{
			lhs.Value -= rhs.Value;
			if (lhs.Value < 0) {
				lhs.Value += P;
			}
 
			return lhs;
		}
 
		public static ModInt operator *(ModInt lhs, ModInt rhs)
		{
			return new ModInt(lhs.Value * rhs.Value % P);
		}
		public static ModInt operator /(ModInt lhs, ModInt rhs)
		{
			long exp = P - 2;
			while (exp > 0) {
				if (exp % 2 > 0) {
					lhs *= rhs;
				}
 
				rhs *= rhs;
				exp /= 2;
			}
 
			return lhs;
		}
 
		public static implicit operator ModInt(long n)
		{
			n %= P;
			if (n < 0) {
				n += P;
			}
 
			return new ModInt(n);
		}
 
		public override string ToString()
		{
			return Value.ToString();
		}
	}
 
	public static class ModCounting
	{
		private static long p_;
 
		private static long[] factorial_;
		private static long[] inverseFactorial_;
		private static long[] inverse_;
 
		public static void InitializeFactorial(long max, long p = 1000000007)
		{
			p_ = p;
 
			factorial_ = new long[max + 1];
			inverseFactorial_ = new long[max + 1];
			inverse_ = new long[max + 1];
 
			factorial_[0] = factorial_[1] = 1;
			inverseFactorial_[0] = inverseFactorial_[1] = 1;
			inverse_[1] = 1;
			for (int i = 2; i <= max; i++) {
				factorial_[i] = factorial_[i - 1] * i % p;
				inverse_[i] = p - inverse_[p % i] * (p / i) % p;
				inverseFactorial_[i] = inverseFactorial_[i - 1] * inverse_[i] % p;
			}
		}
 
		public static long Factorial(long n)
		{
			if (n < 0) {
				return 0;
			}
 
			return factorial_[n];
		}
 
		public static long InverseFactorial(long n)
		{
			if (n < 0) {
				return 0;
			}
 
			return inverseFactorial_[n];
		}
 
		public static long Inverse(long n)
		{
			if (n < 0) {
				return 0;
			}
 
			return inverse_[n];
		}
 
		public static long Permutation(long n, long k)
		{
			if (n < k || (n < 0 || k < 0)) {
				return 0;
			}
 
			return factorial_[n] * inverseFactorial_[n - k] % p_;
		}
 
		public static long RepeatedPermutation(long n, long k)
		{
			long ret = 1;
			for (k %= p_ - 1; k > 0; k >>= 1, n = n * n % p_) {
				if ((k & 1) == 1) {
					ret = ret * n % p_;
				}
			}
 
			return ret;
		}
 
		public static long Combination(long n, long k)
		{
			if (n < k || (n < 0 || k < 0)) {
				return 0;
			}
 
			return factorial_[n] * (inverseFactorial_[k] * inverseFactorial_[n - k] % p_) % p_;
		}
 
		public static long CombinationK(long n, long k)
		{
			long ret = 1;
			for (int i = 0; i < k; i++) {
				ret = (ret * (n - i)) % p_;
				ret = (ret * inverse_[i + 1]) % p_;
			}
 
			return ret;
		}
 
		public static long HomogeneousProduct(long n, long k)
		{
			if (n < 0 || k < 0) {
				return 0;
			}
 
			return Combination(n + k - 1, k);
		}
	}
 
	public class HashMap<TKey, TValue> : Dictionary<TKey, TValue>
	{
		private readonly Func<TKey, TValue> initialzier_;
		public HashMap(Func<TKey, TValue> initialzier)
			: base()
		{
			initialzier_ = initialzier;
		}
 
		public HashMap(Func<TKey, TValue> initialzier, int capacity)
			: base(capacity)
		{
			initialzier_ = initialzier;
		}
 
		new public TValue this[TKey key]
		{
			get
			{
				if (ContainsKey(key) == false) {
					base[key] = initialzier_(key);
				}
 
				return base[key];
			}
 
			set { base[key] = value; }
		}
	}
 
	public static class Helper
	{
		public static void UpdateMin<T>(ref T target, T value) where T : IComparable<T>
			=> target = target.CompareTo(value) > 0 ? value : target;
 
		public static void UpdateMin<T>(ref T target, T value, Action<T> onUpdated) where T : IComparable<T>
		{
			if (target.CompareTo(value) > 0) {
				target = value;
				onUpdated(value);
			}
		}
 
		public static void UpdateMax<T>(ref T target, T value) where T : IComparable<T>
			=> target = target.CompareTo(value) < 0 ? value : target;
		public static void UpdateMax<T>(ref T target, T value, Action<T> onUpdated) where T : IComparable<T>
		{
			if (target.CompareTo(value) < 0) {
				target = value;
				onUpdated(value);
			}
		}
 
		public static T[] Array<T>(int n, Func<int, T> init)
			=> Enumerable.Range(0, n).Select(x => init(x)).ToArray();
		public static List<T> List<T>(int n, Func<int, T> init)
			=> Enumerable.Range(0, n).Select(x => init(x)).ToList();
		public static T[,] Array2<T>(int n, int m, T init)
		{
			var array = new T[n, m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					array[i, j] = init;
				}
			}
 
			return array;
		}
 
		public static T[,] Array2<T>(int n, int m, Func<int, int, T> initializer)
		{
			var array = new T[n, m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					array[i, j] = initializer(i, j);
				}
			}
 
			return array;
		}
 
		public static T[,,] Array3<T>(int n1, int n2, int n3, T init)
		{
			var array = new T[n1, n2, n3];
			for (int i1 = 0; i1 < n1; i1++) {
				for (int i2 = 0; i2 < n2; i2++) {
					for (int i3 = 0; i3 < n3; i3++) {
						array[i1, i2, i3] = init;
					}
				}
			}
 
			return array;
		}
 
		private static readonly int[] delta4_ = { 1, 0, -1, 0, 1 };
		public static void DoAt4(int i, int j, int imax, int jmax, Action<int, int> action)
		{
			for (int n = 0; n < 4; n++) {
				int ii = i + delta4_[n];
				int jj = j + delta4_[n + 1];
				if ((uint)ii < (uint)imax && (uint)jj < (uint)jmax) {
					action(ii, jj);
				}
			}
		}
	}
 
	public class Scanner
	{
		private readonly char[] delimiter_ = new char[] { ' ' };
		private readonly string filePath_;
		private readonly Func<string> reader_;
		private string[] buf_;
		private int index_;
 
		public Scanner(string file = "")
		{
			if (string.IsNullOrWhiteSpace(file)) {
				reader_ = Console.ReadLine;
			} else {
				filePath_ = file;
				var fs = new StreamReader(file);
				reader_ = fs.ReadLine;
			}
			buf_ = new string[0];
			index_ = 0;
		}
 
		public string Next()
		{
			if (index_ < buf_.Length) {
				return buf_[index_++];
			}
 
			string st = reader_();
			while (st == "") {
				st = reader_();
			}
 
			buf_ = st.Split(delimiter_, StringSplitOptions.RemoveEmptyEntries);
			if (buf_.Length == 0) {
				return Next();
			}
 
			index_ = 0;
			return buf_[index_++];
		}
 
		public int Int() => int.Parse(Next());
		public long Long() => long.Parse(Next());
		public double Double() => double.Parse(Next());
 
		public int[] ArrayInt(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Int() + add;
			}
			return Array;
		}
 
		public long[] ArrayLong(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Long() + add;
			}
			return Array;
		}
 
		public double[] ArrayDouble(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Double() + add;
			}
			return Array;
		}
 
		public void Save(string text)
		{
			if (string.IsNullOrWhiteSpace(filePath_)) {
				return;
			}
 
			File.WriteAllText(filePath_ + "_output.txt", text);
		}
	}
}


Measured memory_bytes: 97572