import sys
readline = sys.stdin.readline

def topsort(G):
    Q = []
    count = dict((u, 0) for u in range(len(G)))

    for u in range(len(G)):
        for v in G[u]:
            count[v] += 1

    for u in range(len(G)):
        if count[u] == 0:
            Q.append(u)
    anslst = []
    while Q:
        u = Q.pop()
        anslst.append(u)
        for v in G[u]:
            count[v] -= 1
            if count[v] == 0:
                Q.append(v)
    anslst.reverse()
    return anslst


N = int(readline())
mod = 10 ** 9 + 7
G = [[] for i in range(N)]
for i in range(N - 1):
    A, B = map(int, readline().split())
    A, B = A - 1, B - 1
    G[A].append(B)
    
size = [1] * N
dp = [0] * N
L = topsort(G)
ans = 0
for n in L:
    for u in G[n]:
        dp[n] += dp[u] + size[u]
        dp[n] %= mod
        size[n] += size[u]
    ans += dp[n]
    ans %= mod
print(ans)