#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i=0; i<(int)n; i++)
#define rep2(i, m, n) for(int i=(int)m; i<(int)n; i++)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
const ll INF = 100100100100;
const int MOD = 1000000007;
const ld EPS = 1e-10;
using Graph = vector<vector<int>>;

Graph G;
vector<int> subtree_size;
vector<vector<int>> cc_size;
int N;

void dfs(int v, int p=-1) {
  for (auto nv : G[v]) {
    if (nv == p) continue;
    dfs(nv, v);
  }
  subtree_size[v] = 1;
  for (auto c : G[v]) {
    if (c == p) continue;
    subtree_size[v] += subtree_size[c];
  }
}

void dfs2(int v, int p=-1) {
  int sum = 0;
  for (auto nv : G[v]) {
    if (nv == p) continue;
    cc_size[v].push_back(subtree_size[nv]);
    sum += subtree_size[nv];
  }
  if (p != -1) cc_size[v].push_back(N-sum-1);
  for (auto nv : G[v]) {
    if (nv == p) continue;
    dfs2(nv, v);
  }
}

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
  long long val;
  constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
    if (val < 0) val += MOD;
  }
  constexpr int getmod() { return MOD; }
  constexpr Fp operator - () const noexcept {
    return val ? MOD - val : 0;
  }
  constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
  constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
  constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
  constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
  constexpr Fp& operator += (const Fp& r) noexcept {
    val += r.val;
    if (val >= MOD) val -= MOD;
    return *this;
  }
  constexpr Fp& operator -= (const Fp& r) noexcept {
    val -= r.val;
    if (val < 0) val += MOD;
    return *this;
  }
  constexpr Fp& operator *= (const Fp& r) noexcept {
    val = val * r.val % MOD;
    return *this;
  }
  constexpr Fp& operator /= (const Fp& r) noexcept {
    long long a = r.val, b = MOD, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    val = val * u % MOD;
    if (val < 0) val += MOD;
    return *this;
  }
  constexpr bool operator == (const Fp& r) const noexcept {
    return this->val == r.val;
  }
  constexpr bool operator != (const Fp& r) const noexcept {
    return this->val != r.val;
  }
  friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
    return os << x.val;
  }
  friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
    if (n == 0) return 1;
    auto t = modpow(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
  }
};
using mint = Fp<MOD>;

int main(){
  cin >> N;

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

  subtree_size.assign(N, 0);
  cc_size.assign(N, vector<int>());

  dfs(0);
  dfs2(0);

  mint sum = 0;
  rep(i, N) {
    for (auto s : cc_size[i]) {
      sum += modpow(mint(2), s);
    }
  }
  mint p = modpow(mint(2), N);
  mint ans = mint(N) / mint(2);
  ans += (mint(N-2) - sum) / p;
  cout << ans << endl;
  return 0;
}


Measured memory_bytes: 36224