import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


class TreeDP:
    def __init__(self, graph, merge, add_root, ide_ele):
        self.graph = graph
        self.merge = merge
        self.add_root = add_root
        self.ide_ele = ide_ele
        self.dp = [ide_ele] * len(graph)
        self.depth = [0] * len(graph)
    
    def dfs(self, cur, parent=-1):
        dp_cum = self.ide_ele
        if parent != -1:
            self.depth[cur] = self.depth[parent] + 1
        for child in self.graph[cur]:
            if child == parent:
                continue
            dp_cum = self.merge(dp_cum, self.dfs(child, cur))
        self.dp[cur] = self.add_root(dp_cum)
        return self.dp[cur]


def solve():
    MOD = 10 ** 9 + 7
    N = int(rl())
    graph = [[] for _ in range(N)]
    r = {u for u in range(N)}
    for _ in range(N - 1):
        a, b = map(lambda n: int(n) - 1, rl().split())
        graph[a].append(b)
        r.remove(b)
    
    merge = lambda n, m: n + m
    add_root = lambda n: n + 1
    tree_dp = TreeDP(graph, merge, add_root, 0)

    root = list(r)[0]
    tree_dp.dfs(root)
    ans = 0
    for parent in range(N):
        for child in graph[parent]:
            ans += (tree_dp.depth[parent] + 1) * tree_dp.dp[child]
            ans %= MOD
    print(ans)


if __name__ == '__main__':
    solve()