N = int(input())
E = [[] for _ in range(N)]
for _ in range(N-1):
    u,v = map(int, input().split())
    E[u-1].append(v-1)
    E[v-1].append(u-1)

from collections import deque
q = deque()
q.append((0, 0))
rnk = [-1]*N
rnk[0] = 0
while q:
    temp = q.popleft()
    u = temp[0]
    r = temp[1]
    for v in E[u]:
        if rnk[v] >= 0:
            continue
        rnk[v] = r+1
        q.append((v, r+1))

def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

mod = 10**9+7 #出力の制限
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

for i in range( 2, N + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod )

ans = g1[N]
for i in range(1, N):
    ans += cmb(N, rnk[i]+1, mod) * g1[rnk[i]] * g1[N-rnk[i]-1]
    ans %= mod

print(ans)