import sys
sys.setrecursionlimit(20000000)
#input = sys.stdin.readline
n = int(input())
g = [[] for i in range(n)]
for i in range(n-1):
    u,v = map(int,input().split())
    u-=1;v-=1
    g[u].append(v)
    g[v].append(u)
hu = [0]*n
def dfs(x,y,z):
    hu[x] =y
    for i in g[x]:
        if i == z:
            continue
        dfs(i,y+1,x)
dfs(0,0,-1)
bi = 1
mod = 10**9+7
for i in range(1,n+1):
    bi*=i
    bi%=mod
ans = 0
for i in hu:
    ans+= bi*pow(i+1,mod-2,mod)
    ans %= mod
print(ans)