import strutils, sequtils, math, sets

const MOD = 10 ^ 9 + 7
var
    graph: seq[seq[int]]
    r: HashSet[int]
    dp: array[1000010, int]
    depth: array[1000010, int]


proc solve() =
    let N = stdin.readLine.parseInt
    graph = newSeqWith(N, newSeq[int]())
    r = initHashSet[int]()
    for i in 0..<N:
        r.incl(i)
    var a, b: int
    for _ in 0..<N - 1:
        (a, b) = stdin.readLine.split.map(parseInt)
        a -= 1; b -= 1
        graph[a].add(b)
        r.excl(b)
    
    proc dfs(cur: int, parent: int): int =
        var dp_cum = 0
        if parent != -1:
            depth[cur] = depth[parent] + 1
        for child in graph[cur]:
            dp_cum += dfs(child, cur)
        dp[cur] = dp_cum + 1
        return dp[cur]
    
    let
        root = r.pop()
        _ = dfs(root, -1)
    
    var ans = 0
    for parent in 0..<N:
        for child in graph[parent]:
            ans += (depth[parent] + 1) * dp[child]
            ans = ans mod MOD
    echo ans


when is_main_module:
    solve()