import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;

immutable long MOD = 10^^9 + 7;

void main() {
    auto N = readln.chomp.to!int;
    auto G = new int[][](N);
    foreach (i; 0..N-1) {
        auto s = readln.split.map!(to!int);
        G[s[0]-1] ~= s[1]-1;
        G[s[1]-1] ~= s[0]-1;
    }

    auto sub = new int[](N);

    void dfs1(int n, int p) {
        sub[n] = 1;
        foreach (m ;G[n]) if (p != m) {
            dfs1(m, n);
            sub[n] += sub[m];
        }
    }

    dfs1(0, -1);

    long ans = 0;

    void dfs2(int n, int p) {
        if (G[n].length > 1) {
            long prob = powmod(2, MOD-2, MOD);
            long bb = 0;
            long b0 = 1;
            foreach (m; G[n]) {
                long num = m == p ? N - sub[n] : sub[m];
                long q = powmod(2, num, MOD);
                b0 = b0 * powmod(q, MOD-2, MOD) % MOD;
            }
            bb = b0;
            foreach (m; G[n]) {
                long num = m == p ? N - sub[n] : sub[m];
                long q = powmod(2, num, MOD);
                long b1 = b0 * q % MOD;
                q = (q - 1) * powmod(q, MOD-2, MOD) % MOD;
                q = (q + MOD) % MOD;
                b1 = b1 * q % MOD;
                (bb += b1) %= MOD;
            }
            bb = (1 - bb) % MOD;
            bb = (bb + MOD) % MOD;
            (ans += prob * bb % MOD ) %= MOD;
        }
        foreach (m; G[n]) if (m != p) {
            dfs2(m, n);
        }
    }

    dfs2(0, -1);

    ans.writeln;
}


long powmod(long a, long x, long m) {
    long ret = 1;
    while (x) {
        if (x % 2) ret = ret * a % m;
        a = a * a % m;
        x /= 2;
    }
    return ret;
}
