using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    struct Data {
        public ModInt Value;
        public int Size;
    }
    public void Run() {
        var n = ni();
        var adj = Enumerable.Range(0, n).Select(_ => new List<int>()).ToArray();
        for (int i = 0; i < n - 1; i++) {
            var a = ni() - 1;
            var b = ni() - 1;
            adj[a].Add(b);
            adj[b].Add(a);
        }
        var mod = ModInt.SetModValue(1000000007);
        var C = new Binomial(400000, mod);
        var rerooting = new ReRooting<Data>(
            (d1, d2) => {
                return new Data {
                    Value = d1.Value * d2.Value * C[d1.Size + d2.Size, d1.Size],
                    Size = d1.Size + d2.Size,
                };
            }, (d, idx) => {
                return new Data {
                    Value = d.Value,
                    Size = d.Size + 1,
                };
            }, new Data { Value = 1, Size = 0, }
        );
        var ans = rerooting.Solve(adj);
        cout.WriteLine(string.Join("\n", ans.Select(a => a.Value)));
    }
}

public class ReRooting<TMonoid> {
    private readonly TMonoid _identity;
    private readonly Func<TMonoid, TMonoid, TMonoid> _merge;
    private readonly Func<TMonoid, int, TMonoid> _appendNode;

    public ReRooting(Func<TMonoid, TMonoid, TMonoid> merge,
        Func<TMonoid, int, TMonoid> appendNode,
        TMonoid identity) {
        _merge = merge;
        _appendNode = appendNode;
        _identity = identity;
    }

    public TMonoid[] Solve(List<int>[] adj) {
        var n = adj.Length;
        var ans = new TMonoid[n];
        var parents = new int[n];
        var permutation = new List<int>();
        var visited = new bool[n];
        var stack = new Stack<int>();
        int root = 0;
        stack.Push(root);
        while (stack.Count > 0) {
            var current = stack.Pop();
            if (visited[current]) continue;
            visited[current] = true;
            permutation.Add(current);
            foreach (var child in adj[current]) {
                if (!visited[child]) {
                    parents[child] = current;
                    stack.Push(child);
                }
            }
        }
        var dp = new TMonoid[n];
        foreach (var p in permutation.AsEnumerable().Reverse()) {
            var val = _identity;
            foreach (var child in adj[p]) {
                if (child == parents[p]) continue;
                val = _merge(val, dp[child]);
            }
            dp[p] = _appendNode(val, p);
        }
        var fromParent = new TMonoid[n];
        var accumulateFromTail = new TMonoid[n + 1];
        var subTreeResult = new TMonoid[n];
        foreach (var p in permutation) {
            int count = adj[p].Count;
            var accumulate = _identity;
            if (count > 0) {
                for (int i = 0; i < count; i++) {
                    var child = adj[p][i];
                    subTreeResult[i] = child == parents[p] ? fromParent[p] : dp[child];
                }
                accumulateFromTail[count] = _identity;
                for (int i = count - 1; i >= 0; i--) {
                    accumulateFromTail[i] = _merge(subTreeResult[i], accumulateFromTail[i + 1]);
                }
                for (int i = 0; i < count; i++) {
                    var child = adj[p][i];
                    if (child != parents[p]) {
                        fromParent[child] = _appendNode(_merge(accumulate, accumulateFromTail[i + 1]), child);
                    }
                    accumulate = _merge(accumulate, subTreeResult[i]);
                }
            }
            ans[p] = _appendNode(accumulate, p);
        }
        return ans;
    }
}

public class Binomial {
    private readonly long[] factorial;
    private readonly long[] inverseFactorial;
    private readonly long[] inverse;
    private readonly int mod;

    public Binomial(int size, int primeMod) {
        size++;
        factorial = new long[size];
        inverseFactorial = new long[size];
        inverse = new long[size];
        mod = primeMod;
        Setup(size);
    }

    private void Setup(int size) {
        factorial[0] = factorial[1] = 1;
        inverseFactorial[0] = inverseFactorial[1] = 1;
        inverse[1] = 1;
        for (int i = 2; i < size; i++) {
            factorial[i] = factorial[i - 1] * i % mod;
            inverse[i] = (mod - (mod / i) * inverse[mod % i] % mod);
            inverseFactorial[i] = inverseFactorial[i - 1] * inverse[i] % mod;
        }
    }

    private long C(int s, int t) {
        if (s < 0 || t < 0 || s < t) {
            return 0;
        }

        if (t == 0 || s == t) {
            return 1;
        }

        if (s >= mod) {
            return C(s % mod, t % mod) * C(s / mod, t / mod) % mod; // Lucas' theorem
        }

        return factorial[s] * inverseFactorial[t] % mod * inverseFactorial[s - t] % mod;
    }

    public long this[int s, int t] {
        get {
            return C(s, t);
        }
    }

    public long P(int s, int t) {
        if (s < 0 || t < 0 || s < t) return 0;
        return factorial[s] * inverseFactorial[s - t] % mod;
    }

    /// <summary>
    /// s 種類のものから重複を許して t 個選ぶ場合の数
    /// </summary>
    public long H(int s, int t) {
        if (s < 0 || t < 0) return 0;
        if (s == 0 && t == 0) return 1;
        return C(s + t - 1, t);
    }

    public long H1(int s, int t) {
        return H(s - t, t);
    }
}
public struct ModInt : IEquatable<ModInt> {
    private static int mod = 0;
    private long _value;

    public ModInt(long x) {
        _value = x;
        Normalize();
    }

    private static long RegularMod(long x, int mod) {
        if (x >= mod) {
            if (x < 2 * mod) {
                return x - mod;
            }

            return x % mod;
        }
        if (x >= 0) {
            return x;
        }

        x = mod - RegularMod(-x, mod);
        if (x == mod) {
            return 0;
        }

        return x;
    }

    public static int SetModValue(int m) {
        return mod = m;
    }

    private void Normalize() {
        _value = RegularMod(_value, mod);
    }

    public override string ToString() {
        return _value.ToString(CultureInfo.InvariantCulture);
    }

    public int ToInt() {
        return (int)_value;
    }

    public static bool operator ==(ModInt c1, ModInt c2) {
        return c1._value == c2._value;
    }

    public static bool operator !=(ModInt c1, ModInt c2) {
        return !(c1 == c2);
    }

    public static ModInt operator +(ModInt x, ModInt y) {
        return new ModInt(x._value + y._value);
    }
    public static ModInt operator -(ModInt x, ModInt y) {
        return new ModInt(x._value - y._value);
    }
    public static ModInt operator -(ModInt x) {
        return new ModInt(-x._value);
    }
    public static ModInt operator *(ModInt x, ModInt y) {
        return new ModInt(x._value * y._value);
    }
    public static ModInt operator /(ModInt x, ModInt y) {
        return new ModInt(x._value * Inverse(y._value, mod));
    }
    public static ModInt operator ++(ModInt x) {
        return x + 1;
    }
    public static ModInt operator --(ModInt x) {
        return x - 1;
    }
    public static ModInt Pow(ModInt x, long n) {
        ModInt r = 1;
        while (n > 0) {
            if ((n & 1) != 0) {
                r *= x;
            }

            x *= x;
            n >>= 1;
        }
        return r;
    }
    private static long ExtendedGcd(long a, long b, ref long x, ref long y) {
        if (b == 0) {
            x = 1; y = 0;
            return a;
        } else {
            var d = ExtendedGcd(b, a % b, ref y, ref x);
            y -= a / b * x;
            return d;
        }
    }

    private static long Inverse(long a, long mod) {
        long x = 0, y = 0;
        if (ExtendedGcd(a, mod, ref x, ref y) == 1) {
            return (x + mod) % mod;
        } else {
            throw new Exception("Invalid inverse " + a + " " + mod);
        }
    }

    public static implicit operator ModInt(long x) {
        return new ModInt(x);
    }

    public override bool Equals(object obj) {
        if (obj == null) {
            return false;
        }
        return _value.Equals(((ModInt)obj)._value);
    }

    public override int GetHashCode() {
        return _value.GetHashCode();
    }

    public bool Equals(ModInt other) {
        return _value.Equals(other._value);
    }
}
// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new InvalidOperationException();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}

Measured memory_bytes: 73244