import sys
input=sys.stdin.readline

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

N = int(input())
mod = 10**9+7
edge = [[] for _ in range(N)]
for _ in range(N-1):
  a,b = map(int, input().split())
  edge[a-1].append(b-1)
nums = [0]*N
child = [0]*N
parent = [N]*N
for i in range(N):
  if parent[i]==N:
    dfs(i)
ans = sum(nums)
print(ans)