package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

const mod = 1000000007
const facNum = 300001

var to [][]int
var dps []DP

var fac []int
var ifac []int

type DP struct {
	p int // 整数の書き方の数
	t int // node num
}

func (d DP) Add(dp DP) DP {
	d.p = d.p * dp.p % mod
	d.p *= combination(d.t+dp.t, d.t, fac, ifac)
	d.p %= mod
	d.t += dp.t
	return d
}

func (d DP) Sub(dp DP) DP {
	d.t -= dp.t
	d.p *= Inv(combination(d.t+dp.t, d.t, fac, ifac))
	d.p %= mod
	d.p *= Inv(dp.p)
	d.p %= mod
	return d
}

func (d DP) AddRoot() DP {
	d.t += 1
	return d
}
func (d DP) SubRoot() DP {
	d.t -= 1
	return d
}

func dfs(v int, p int) {
	for _, u := range to[v] {
		if u == p {
			continue
		}
		dfs(u, v)
		dps[v] = dps[v].Add(dps[u].AddRoot())
	}
	//dps[v] = dps[v].AddRoot()
}

func bfs(v, p int) {
	for _, u := range to[v] {
		if u == p {
			continue
		}
		d := dps[v].Sub(dps[u].AddRoot())
		//dps[u] = dps[u].SubRoot()
		dps[u] = dps[u].Add(d.AddRoot())
		//dps[u] = dps[u].AddRoot()
		bfs(u, v)
	}
}

func main() {
	sc := newScanner(os.Stdin)
	N := sc.i()
	//a := make([]int, N)
	//b := make([]int, N)
	to = make([][]int, N)
	for i := 0; i < N-1; i++ {
		a, b := sc.i(), sc.i()
		a--
		b--
		to[a] = append(to[a], b)
		to[b] = append(to[b], a)
	}

	fac, ifac = factorial()
	dps = make([]DP, N)
	for i := 0; i < N; i++ {
		dps[i] = DP{1, 0}
	}
	dfs(0, 0)
	bfs(0, 0)
	for _, d := range dps {
		fmt.Println(d.p)
	}
}

// fmt.Println("Yes")
// fmt.Println("No")

// I/O
type scanner struct {
	sc *bufio.Scanner
}

func newScanner(input io.Reader) *scanner {
	sc := bufio.NewScanner(input)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &scanner{sc}
}

func (s *scanner) s() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *scanner) i() int {
	i, e := strconv.Atoi(s.s())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *scanner) f() float64 {
	f, e := strconv.ParseFloat(s.s(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *scanner) bs() []byte {
	return []byte(s.s())
}

func (s *scanner) is(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.i()
	}
	return res
}

func (s *scanner) fs(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.f()
	}
	return res
}

//------------------------------

//const factorial = new
func Pow(a, n int) int {
	ans := 1
	for n > 0 {
		if (n & 1) == 1 {
			ans = ans * a % mod
		}
		a = a * a % mod
		n = n >> 1
	}
	return ans
}

// a^{-1} (mod) を計算
func Inv(a int) int {
	return Pow(a, mod-2)
}

func Gcd(a, b int) int {
	if a < b {
		return Gcd(b, a)
	}
	for b != 0 {
		a, b = b, a%b
	}
	return a
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func combination(n, k int, fac, ifac []int) int {
	if n < k || n < 0 {
		return 0
	}
	if k == 0 {
		return 1
	}
	//while n != 0
	ans := ifac[k] * ifac[n-k] % mod
	return ans * fac[n] % mod
}

func abs(i int) int {
	if i < 0 {
		return -i
	}
	return i
}

// 階乗: factorial
// コンビネーションを計算する際に前もって計算しておく
// fac[k] => k! (mod M)
// ifac[k] => k!^(M-2) (mod M)
// n: ex. 2 * 10^5 => 200001
// fac, ifac := factorial()
func factorial() (fac []int, ifac []int) {
	fac = make([]int, facNum)
	fac[0] = 1
	ifac = make([]int, facNum)
	ifac[0] = 1
	for i := 1; i < facNum; i++ {
		fac[i] = fac[i-1] * i % mod
		ifac[i] = ifac[i-1] * Pow(i, mod-2) % mod
	}
	return
}

// vs: sorted slice int value
func lowerBound(vs []int, v int) (index int) {
	n := len(vs) / 2
	m := len(vs)
	for m != n {
		if vs[n] < v {
			n = (m-n+1)/2 + n
			//m = m
		} else {
			m = n
			n = n / 2
		}
	}
	return n
}

func IntSlice(n, init int) []int {
	r := make([]int, n)
	for i := range r {
		r[i] = init
	}
	return r
}


Measured memory_bytes: 28848