import collections
class NCK:
    '''
    最大値 :N
    mod
    '''
    def __init__(self,N,mod):
        self.mod = mod
        self.N = N
        self.factmod = [1,1]
        for i in range(2,self.N+1):
            self.factmod.append((self.factmod[-1]*i)%self.mod)

        self.inv = [0,1]
        for i in range(2, N + 1):
            self.inv.append((-self.inv[self.mod % i] * (self.mod // i)) % self.mod)

        self.invfact = [1,1]
        for i in range(2, N + 1):
            self.invfact.append((self.invfact[-1]*self.inv[i])%self.mod)

    def nCk(self,a,b):
        if a < b:
            return 0
        return ((self.factmod[a]*self.invfact[b]%self.mod)*self.invfact[a-b])%self.mod
    
    def invnCk(self,a,b):
        return ((self.factmod[a-b]*self.invfact[a]%self.mod)*self.factmod[b])%self.mod

N = int(input())
lsg = [[] for i in range(N)]
for i in range(N-1):
    a,b = map(int,input().split())
    a -= 1
    b -= 1
    lsg[a].append(b)
    lsg[b].append(a)
INF = float('INF')
cost = [INF]*(N)
used = [False]*(N)
cost[0] = 0
d = collections.deque([0])
while d:
    n = d.popleft()
    if used[n]:
        continue
    used[n] = True
    for j in lsg[n]:
        if used[j]:
            continue
        if cost[j] > cost[n]+1:
            cost[j] = cost[n]+1
            d.append(j)
mod = 10**9+7
nck = NCK(N+1, mod)
ans = 0
for i in range(N):
    dist = cost[i]
    ans += nck.nCk(N, dist+1)*nck.factmod[dist]*nck.factmod[N-dist-1]
    ans %= mod
print(ans)