#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';

const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 3e5+7;

int mod(int n) {
    n %= MOD;
    if (n < 0) return n + MOD;
    else return n;
}   
int fp(int a, int p) {
    int ans = 1, c = a;
    for (int i = 0; (1ll << i) <= p; ++i) {
        if ((p >> i) & 1) ans = mod(ans * c);
        c = mod(c * c);
    }   
    return ans;
}   
int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); }

int pw[N], inv[N], inv2;

vector <int> g[N];
int up[N];
int sum[N];
int par[N];

void add(int &a, int b) {
    a = mod(a + b);
}   
void dfs1(int u, int p) {
    par[u] = p;
    sum[u] = 1;
    for (int v : g[u]) {
        if (v != p) {
            dfs1(v, u);
            add(sum[u], sum[v] * inv2);
        }   
    }   
}   
void dfs2(int u, int p) {
    int s = 0;
    for (int v : g[u]) {
        if (v != p) {
            add(s, sum[v]);
        }   
    }   
    for (int v : g[u]) {
        if (v != p) {
            int oth = mod(s - sum[v]);
            up[v] = mod(mod(up[u] + oth) * inv2 + 1);
            dfs2(v, u);
        }   
    }   

}   

int n;
int solve(int root) {
    vector <int> d;
    for (int v : g[root]) {
        if (v != par[root]) {
            d.app(sum[v]);
        }
    }
    if (root != 1) {
        d.app(up[root]);
    }   

    for (int &e : d)
        e = mod(e * inv2);

    /*
    debug(root);
    for (auto e : d)
        cout << e << ' ';
    cout << endl;
    */

    int t = 0;
    for (int e : d) {
        t += e;
        t %= MOD;
    }        

    int ans = ((t * t) % MOD) * t % MOD;
    ans = mod(ans + t * t * 3);
    for (int e : d) {
        ans -= 3 * mod(mod(e * e) * t);
        ans += 2 * mod(mod(e * e) * e);
        ans = mod(ans);
    }   
    for (int e : d) {
        ans -= mod(e * e * 3);
        ans = mod(ans);
    }   
    for (int e : d) {
        ans = mod(ans + e * 3);
    }   

    ans = mod(ans + 1);


    return ans;
}   
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    pw[0] = 1;
    for (int i = 1; i < N; ++i)
        pw[i] = pw[i - 1] * 2 % MOD;
    for (int i = 0; i < N; ++i)
        inv[i] = fp(pw[i], MOD - 2);
    inv2 = fp(2, MOD - 2);            

    cin >> n;
    for (int i = 0; i < n - 1; ++i) {
        int u, v;
        cin >> u >> v;
        g[u].app(v); g[v].app(u);
    }   

    dfs1(1, 1);
    dfs2(1, 1);

    /*
    for (int i = 1; i <= n; ++i)
        cout << sum[i] << ' ';
    cout << endl;

    for (int i = 1; i <= n; ++i)
        cout << up[i] << ' ';
    cout << endl;

    debug(dv(1, 2));
    */

    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        ans += solve(i);
        ans %= MOD;
    }
    cout << mod(ans * pw[n - 1]) << endl;
}