import sys
input = sys.stdin.buffer.readline


n = int(input())
info = [list(map(int, input().split())) for i in range(n - 1)]
MOD = 10 ** 9 + 7


tree = [[] for i in range(n)]
for a, b in info:
    a -= 1
    b -= 1
    tree[b].append(a)

cnt_ = [0] * n
for v in range(n):
    for nxt_v in tree[v]:
        cnt_[nxt_v] += 1

dp_cnt = [1] * n
dp_ptn = [0] * n
stack = [i for i in range(n) if cnt_[i] == 0]
while stack:
    v = stack.pop()
    for nxt_v in tree[v]:
        dp_cnt[nxt_v] += dp_cnt[v]
        dp_ptn[nxt_v] += dp_ptn[v] + dp_cnt[v]
        dp_ptn[nxt_v] %= MOD
        cnt_[nxt_v] -= 1
        if cnt_[nxt_v] == 0:
            stack.append(nxt_v)

ans = 0
for i in range(n):
    ans += dp_ptn[i]
    ans %= MOD
print(ans)