#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

ostream& operator<< (ostream &a, const vector<int> &b) {
    for (auto k : b) cout << k << " ";
    return a;
}

istream& operator>> (istream& a, pii& b) {
    cin >> b.first >> b.second;
    return a;
}

ostream& operator<< (ostream& a, const pii& b) {
    cout << "{" << b.first << ", " << b.second << "}";
    return a;
}

template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) {if (x > y) x = y;}
template <typename T1, typename T2> inline void chkmax(T1 &x, const T2 &y) {if (x < y) x = y;}


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << "\n";
    const int INF = 1e18;
    // const int mod = 2600000069;
    // const int p = 10;
    // const ld PI = 3.1415926535;
#else
    #define dbg(x)
    const int INF = 1e18;
    // const int mod = 2600000069;
    // const int p = 179;
    // const ld PI = 3.1415926535;
#endif

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")  
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 2e5 + 10;
const int mod = 1e9 + 7;

int n;
vector<int> g[MAXN];
int sz[MAXN];

void dfs(int v, int p) {
    sz[v] = 1;
    for (auto u : g[v]) {
        if (u == p) continue;
        dfs(u, v);
        sz[v] += sz[u];
    }
}

int powmod(int a, int p) {
    if (p == 0) return 1;
    if (p == 1) return a % mod;
    int k = powmod(a, p / 2);
    if (p & 1) return (k * k % mod) * a % mod;
    return k * k % mod;
}

int rev(int x) {
    return powmod(x, mod - 2);
}

void add(int& a, int b) {
    a += b;
    a %= mod;
}

void sub(int& a, int b) {
    a -= b;
    if (a < 0) a += mod;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    int u, v;
    for (int i = 0; i < n - 1; i++) {
        cin >> u >> v;
        u--, v--;
        g[u].pb(v);
        g[v].pb(u);
    }
    dfs(0, -1);
    int ans = 0;
    for (int i = 0; i < n; i++) {
        vector<int> s;
        int sum = 0;
        for (auto u : g[i]) {
            if (sz[u] < sz[i]) {
                s.pb(sz[u]);
                sum += sz[u];
            }
        }
        if (n - sum - 1 > 0) s.pb(n - sum - 1);
        if (s.size() < 2) continue;
        add(ans, powmod(2, n - 1));
        sub(ans, 1);
        for (auto k : s) {
            sub(ans, powmod(2, k) - 1);
        }
    }
    int val = rev(powmod(2, n));
    val = (val * ans) % mod;
    cout << val;
}
/*

*/  

Measured memory_bytes: 19712