import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

MOD = 10**9 + 7

inv2 = pow(2, MOD - 2, MOD)
inv4 = inv2**2 % MOD

def dfs_order(G, root=1):
    parent = [0] * (N + 1)
    order = []
    stack = [root]
    while stack:
        x = stack.pop()
        order.append(x)
        for y in G[x]:
            if y == parent[x]:
                continue
            parent[y] = x
            stack.append(y)
    return parent, order

N = int(readline())
m = map(int, read().split())
G = [[] for _ in range(N + 1)]
for a, b in zip(m, m):
    G[a].append(b)
    G[b].append(a)

root = 1
parent, order = dfs_order(G, root)

mu1 = [0] * (N + 1)
var1 = [0] * (N + 1)
for v in order[::-1]:
    p = parent[v]
    mu1[v] += 1
    mu1[v] %= MOD
    var1[v] %= MOD
    mu1[p] += inv2 * mu1[v]
    var1[p] += var1[v] * inv2 + mu1[v] * mu1[v] * inv4

mu2 = [0] * (N + 1)
var2 = [0] * (N + 1)
for v in order:
    mu2[v] = mu1[v]
    var2[v] = var1[v]
    if v == root:
        continue
    p = parent[v]
    mu = mu2[p] - mu1[v] * inv2
    var = var2[p] - inv2 * var2[v] - mu1[v]**2 * inv4
    mu2[v] += mu * inv2
    var2[v] += mu * mu * inv4 + var * inv2
    mu2[v] %= MOD
    var2[v] %= MOD

ans = 0
for v in range(1, N+1):
    ans += mu2[v] ** 2 + var2[v]
ans *= pow(2, N-1, MOD)
print(ans % MOD)