#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
const double eps = 1e-8;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<class T> ostream& operator << (ostream& os, const set<T>& s) { for (auto si : s) os << si << " "; return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { (a += (b % mod + mod)) %= mod; }
template<class T> void operator += (vector<T>& v, vector<T> v2) { rep(i, sz(v2)) v.eb(v2[i]); }

void solve();

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(12); // debuged
    int T;
    T = 1;
    while (T--) solve();
}

// https://atcoder.jp/contests/abc149/submissions/16071459
// mint使うべき
void solve() {
    int n;
    cin >> n;
    vector<vector<int> > G(n);
    rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        --a; --b;
        G[a].eb(b);
        G[b].eb(a);
    }
    
    vector<ll> d(n, 1);
    auto dfs = [&](auto&& dfs, int v, int p) -> int {
        int sum = 0;
        for (int nv : G[v]) {
            if (nv == p) continue;
            int cnt = dfs(dfs, nv, v);
            sum += cnt;
            add(d[v], modpow(2, cnt, mod) - 1); // 1つの枝だけ1つ以上黒がある
        }
        // 親方向
        int rest = (n - 1) - sum;
        add(d[v], modpow(2, rest, mod) - 1);
        
        d[v] = (modpow(2, n - 1, mod) - d[v] + mod) % mod; // 余事象
        return sum + 1;
    };
    rep(i, n) {
        if (sz(G[i]) == 1) {
            dfs(dfs, i, -1);
            break;
        }
    }
    // cerr << d << endl;
    
    ll ans = accumulate(all(d), 0LL) % mod; // debuged
    (ans *= modpow(modpow(2, n, mod), mod - 2, mod)) %= mod;
    cout << ans << endl;
}


Measured memory_bytes: 33244