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
    
    # Precompute factorials
    fact = [1] * (N + 1)
    for i in range(1, N + 1):
        fact[i] = fact[i - 1] * i % MOD
    
    # BFS to compute depth of each node
    from collections import deque
    depth = [0] * (N + 1)
    visited = [False] * (N + 1)
    q = deque()
    q.append(1)
    visited[1] = True
    depth[1] = 1
    
    while q:
        u = q.popleft()
        for v in edges[u]:
            if not visited[v]:
                visited[v] = True
                depth[v] = depth[u] + 1
                q.append(v)
    
    sum_inv = 0
    for i in range(1, N + 1):
        d = depth[i]
        sum_inv = (sum_inv + pow(d, MOD - 2, MOD)) % MOD
    
    ans = fact[N] * sum_inv % MOD
    print(ans)

if __name__ == '__main__':
    main()