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

long long const MOD = 1000000007;

long long powmod(long long x, long long n) {
    long long ret = 1;
    while(n > 0) {
        if(n & 1) ret = ret * x % MOD;
        x = x * x % MOD;
        n >>= 1;
    }
    return ret;
}

int N;
vector<vector<int>> G;
long long res = 0;

int dfs(int v, int p) {
    int xe = 1;
    for(int to : G[v]) {
        if(to == p) continue;
        xe += dfs(to, v);
    }
    if(p != -1) res = (res + (powmod(2LL, xe) - 1) * (powmod(2LL, N - xe) - 1) % MOD) % MOD;
    return xe;
}

int main() {
    cin >> N;
    G.assign(N, vector<int>());
    for(int i=1; i<N; ++i) {
        int a, b; cin >> a >> b;
        --a; --b;
        G[a].push_back(b);
        G[b].push_back(a);
    }

    dfs(0, -1);
    res = (res - 1 + powmod(2LL, N) - N * powmod(2LL, N - 1)) % MOD;
    res = (res + MOD) % MOD;
    res = res * powmod(powmod(2LL, N), MOD - 2) % MOD;
    cout << res << endl;
}