#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll mod_pow(ll n, ll p, ll mod) {
    ll ret = 1;
    while (p > 0) {
        if (p & 1) ret = ret * n % mod;
        n = n * n % mod;
        p >>= 1;
    }
    return ret;
}

ll mod_inv(ll n, ll mod) {
    return mod_pow(n, mod-2, mod);
}

const ll mod = 1e9 + 7;
vector<vector<int>> G;
vector<int> sz, parent;

void dfs(int v, int p) {
    parent[v] = p;
    for (int c : G[v]) {
        if (c == p) continue;
        dfs(c, v);
        sz[v] += sz[c];
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int N;
    cin >> N;
    G.resize(N);
    for (int i = 0; i < N - 1; i++) {
        int A, B;
        cin >> A >> B;
        A--;
        B--;
        G[A].push_back(B);
        G[B].push_back(A);
    }
    sz.resize(N, 1);
    parent.resize(N, 0);
    dfs(0, -1);

    ll ans = 0;
    ll two_inv = mod_inv(2, mod);
    for (int v = 0; v < N; v++) {
        ll prob1 = 0;
        int s = 1;
        for (int c : G[v]) {
            if (c == parent[v]) continue;
            s += sz[c];
            prob1 += (1 - mod_pow(two_inv, sz[c], mod) + mod) * mod_pow(two_inv, N - sz[c], mod) % mod;
            prob1 %= mod;
        }
        prob1 += (1 - mod_pow(two_inv, N - s, mod) + mod) * mod_pow(two_inv, s, mod) % mod;
        prob1 %= mod;
        ll prob = (two_inv - mod_pow(two_inv, N, mod) - prob1 + mod * 2) % mod;
        ans = (ans + prob) % mod;
    }
    cout << ans << endl;
}