import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = int(input())
mod = 10 ** 9 + 7
E = [[] for _ in range(N)]
D = [0] * N
for _ in range(N - 1):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    E[a].append(b)
    D[b] += 1
C = [0] * N
acc = [0] * N


def dfs(v):
    res = 1
    for d in E[v]:
        res += dfs(d)
    C[v] = res
    return C[v]


def dfs2(v):
    res = C[v] - 1
    for d in E[v]:
        res += dfs2(d)
        res %= mod
    acc[v] = res
    return acc[v]


for i in range(N):
    if D[i] == 0:
        s = i
        break
dfs(s)
dfs2(s)
print(sum(acc) % mod)