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)]
par = [-1] * 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
    par[b] = a

for i in range(N):
    if D[i] == 0:
        s = i
        break

dq = deque([s])
INF = 1 << 30
depth = [INF] * N
depth[s] = 0
while dq:
    v = dq.popleft()
    for d in E[v]:
        if depth[d] > depth[v] + 1:
            depth[d] = depth[v] + 1
            dq.append(d)

V = [(i, depth[i]) for i in range(N)]
V.sort(key=lambda x: x[1], reverse=True)

cnt = [1] * N
acc = [0] * N
for i, _ in V:
    acc[i] += cnt[i] - 1
    if i == s:
        break
    p = par[i]
    cnt[p] += cnt[i]
    acc[p] += acc[i]
ans = 0
for i in range(N):
    ans += acc[i]
    ans %= mod
print(ans)