from collections import deque

MOD = 10**9 + 7

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    
    idx = 0
    N = int(data[idx])
    idx += 1
    
    edges = [[] for _ in range(N+1)]
    for _ in range(N-1):
        u = int(data[idx])
        v = int(data[idx+1])
        edges[u].append(v)
        edges[v].append(u)
        idx += 2
    
    # BFS to compute depth of each node
    depth = [0] * (N + 1)
    parent = [0] * (N + 1)
    parent[1] = -1
    depth[1] = 1
    q = deque([1])
    
    while q:
        u = q.popleft()
        for v in edges[u]:
            if parent[u] == v:
                continue
            if depth[v] == 0:
                depth[v] = depth[u] + 1
                parent[v] = u
                q.append(v)
    
    # Compute factorial
    fact = [1] * (N + 1)
    for i in range(1, N + 1):
        fact[i] = fact[i-1] * i % MOD
    
    # Compute sum of inverses
    sum_inv = 0
    for v in range(1, N + 1):
        s = depth[v]
        inv_s = pow(s, MOD-2, MOD)
        sum_inv = (sum_inv + inv_s) % MOD
    
    ans = fact[N] * sum_inv % MOD
    print(ans)

if __name__ == "__main__":
    main()