import sys


MAX_N = 200005
MOD = 1000000007


def make():
    inv[1] = 1
    for i in range(2, MAX_N):
        inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD


def dfs():
    head = 1
    stack[0], stack[1] = -1, 0
    while head > 0:
        cur, prv, depth = stack[head], stack[head-1], head
        if visit[cur] == 0:
            d[depth] += 1
        if visit[cur] == len(G[cur]):
            head -= 1
            continue
        nx = G[cur][visit[cur]]
        if nx != prv:
            head += 1
            stack[head] = nx
        visit[cur] += 1


if __name__ == '__main__':
    n = int(sys.stdin.readline())
    G = [[] for _ in range(n)]
    inv, d, visit, stack = [0]*MAX_N, [0]*MAX_N, [0]*MAX_N, [0]*MAX_N
    fac = 1
    for i in range(n-1):
        u, v = map(int, sys.stdin.readline().split())
        G[u-1].append(v-1), G[v-1].append(u-1)
        fac = fac * (i+2) % MOD
    make()
    dfs()
    ans = 0
    for i in range(1, n+1):
        ans += fac * d[i] * inv[i] % MOD
    print(ans % MOD)