#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

ll mod_pow(ll x, ll p, ll M = MOD) {
  ll a = 1;
  while (p) {
    if (p % 2)
      a = a*x%M;
    x = x*x%M;
    p /= 2;
  }
  return a;
}

ll mod_inverse(ll a, ll M = MOD) {
  return mod_pow(a, M - 2, M);
}


vii G;
vl dp;
ll inv2 = mod_inverse(2);

ll dfs1(int now, int par) {
  ll mul = 1;
  for (int ch: G[now]) {
    if (ch == par) continue;
    mul = mul * (1 - dfs1(ch, now)) % MOD;
  }
  dp[now] = (1 - mul * inv2 % MOD + MOD) % MOD;
  return dp[now];
}

ll ans = 0;

void dfs2(int now, int par) {
  //DEBUG(now);
  vl white;
  for (int ch: G[now]) {
    white.push_back((1 - dp[ch] + MOD) % MOD);
  }
  int n = white.size();
  vl left(n + 1), right(n + 1);
  left[0] = 1;
  rep (i, n) {
    left[i + 1] = left[i] * white[i] % MOD;
  }
  right[0] = 1;
  rep (i, n) {
    right[i + 1] = right[i] * white[n - 1 - i] % MOD;
  }

  /*
  DEBUG_VEC(dp);
  DEBUG_VEC(white);
  DEBUG_VEC(left);
  DEBUG_VEC(right);
  //*/

  ll ng = 0;
  ng += left[n];
  rep (i, n) {
    ll add = left[i] * right[n - 1 - i] % MOD;
    (add *= (1 - white[i])) %= MOD;
    (ng += add) %= MOD;
  }
  //DEBUG(ng);
  (ans += (1 - ng) % MOD * inv2 % MOD) %= MOD;

  ll ori = dp[now];
  int cnt = 0;
  for (int ch: G[now]) {
    if (ch == par) {
      cnt++;
      continue;
    }
    ll ori_ch = dp[ch];
    ll add = left[cnt] * right[n - 1 - cnt] % MOD;
    dp[now] = (1 - add * inv2 % MOD + MOD) % MOD;
    dp[ch] = (1 - ((1 - ori_ch) * dp[now] % MOD) + MOD) % MOD;
    dfs2(ch, now);
    dp[now] = ori;
    dp[ch] = ori_ch;
    cnt++;
  }
}

signed main() {
  fio();
  int n;
  cin >> n;
  G.resize(n);
  dp.resize(n);
  rep (i, n - 1) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  //DEBUG_MAT(G);

  dfs1(0, -1);
  //DEBUG_VEC(dp);

  dfs2(0, -1);
  cout << (ans + MOD) % MOD << endl;
}


Measured memory_bytes: 51584