from collections import deque
import math
n=int(input())
E=[[] for _ in range(n)]
for i in range(n-1):
  a,b=map(int,input().split())
  a-=1
  b-=1
  E[a].append(b)
  E[b].append(a)
depth=[0]*n
seen=[0]*n
seen[0]=1
stack=deque([0])
while stack:
  u=stack.pop()
  for v in E[u]:
    if seen[v]!=1:
      seen[v]=1
      depth[v]=depth[u]+1
      stack.append(v)
mod=10**9+7
v=math.factorial(n)
ans=0
for i in range(n):
  ans+=(v//(depth[i]+1)%mod)
  ans%=mod
print(ans)