import sys
input=sys.stdin.readline

def dfs(start):
  global ans,mod
  stack = [start]
  depth = [-1]*N
  child_num = [0]*N
  depth[start] = 0
  while stack:
    v = stack[-1]
    marker = 0
    for u in edge[v]:
      if depth[u]==-1: #前半
        marker = 1
        depth[u]=depth[v]+1
        stack.append(u)
      else: #後半
        ans += (depth[v]+1)*(child_num[u]+1)
        child_num[v] += child_num[u]+1
        ans %= mod
    if marker==0: #後半だったら
      stack.pop()
  return

N = int(input())
mod = 10**9+7
edge = [[] for _ in range(N)]
roots = [True]*N
for i in range(N-1):
  a,b = list(map(int, input().split()))
  roots[b-1] = False
  edge[a-1].append(b-1)

root = roots.index(True)
ans = 0
dfs(root)
print(ans)