#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
constexpr long MOD = 1e9 + 7;

long modpow(long x, long e) {
  long res = 1;
  while(e) {
    if (e & 1) res = res * x % MOD;
    x = x * x % MOD;
    e >>= 1;
  }
  return res;
}

long modinv(long x) {
  return modpow(x, MOD - 2);
}

// ---- 
int n, a, b, size[200020];
vector<int> g[200020];
// ----

int rec1(int p, int v) {
  int res = 1;
  for(int nv: g[v]) {
    if(p == nv) continue;
    res += rec1(v, nv);
  }
  return size[v] = res;
}

long rec2(int p, int v) {
  long res = 0;
  for(int nv: g[v]) {
    if(p == nv) continue;
    res = (res + rec2(v, nv) + (1 - modinv(modpow(2, size[nv])) + MOD) % MOD * (1 - modinv(modpow(2, n - size[nv])) + MOD) % MOD) % MOD;
  }
  return res;
}

int main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> n;
  for(int i = 0; i < n - 1; ++i) {
    cin >> a >> b;
    --a, --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }

  rec1(-1, 0);
  long S_exp = rec2(-1, 0) + (modpow(2, n) - 1) * modinv(modpow(2, n)) % MOD;
  long black_exp = n * modinv(2) % MOD;
  cout << (S_exp - black_exp + MOD) % MOD;
  return 0;
}