#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define rev(i,s,e) for(i64 (i) = (s);(i) --> (e);)
#define all(x) x.begin(),x.end()

template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) noexcept {
  return std::vector<T>(n, std::forward<T>(val));
}

template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) noexcept {
  return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}


#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

template<i64 M>
struct modint {
  i64 a;
  constexpr modint(const i64 x = 0) noexcept: a((x % M + M) % M) {}
  constexpr i64 value() const noexcept { return a; }
  constexpr modint pow(i64 r) const noexcept {
    modint ans(1);
    modint aa = *this;
    while(r) {
      if(r & 1) {
        ans *= aa;
      }
      aa *= aa;
      r >>= 1;
    }
    return ans;
  }
  constexpr modint& operator+=(const modint r) noexcept {
    a += r.a;
    if(a >= M) a -= M;
    return *this;
  }
  constexpr modint& operator=(const i64 r) {
    a = (r % M + M) % M;
    return *this;
  }
  constexpr modint& operator-=(const modint r) noexcept {
    a -= r.a;
    if(a < 0) a += M;
    return *this;
  }
  constexpr modint& operator*=(const modint r) noexcept {
    a = a * r.a % M;
    return *this;
  }
  constexpr modint& operator/=(modint r) noexcept {
    i64 ex = M - 2;
    while(ex) {
      if(ex & 1) {
        *this *= r;
      }
      r *= r;
      ex >>= 1;
    }
    return *this;
  }

  constexpr modint operator+(const modint r) const {
    return modint(*this) += r;
  }
  constexpr modint operator-(const modint r) const {
    return modint(*this) -= r;
  }
  constexpr modint operator*(const modint r) const {
    return modint(*this) *= r;
  }
  constexpr modint operator/(const modint r) const {
    return modint(*this) /= r;
  }
};

template<const i64 M>
std::ostream& operator<<(std::ostream& os, const modint<M>& m) {
  os << m.value();
  return os;
}

vector<vector<i64>> G;

vector<i64> sum;

void dfs(i64 v, i64 f) {
  sum[v] += 1;
  for(auto t: G[v]) {
    if(t == f) continue;
    dfs(t, v);
    sum[v] += sum[t];
  }
}


using fp = modint<(i64)(1e9 + 7)>;

i64 N;
vector<fp> bin;
vector<fp> ans;

void reroot(i64 v, i64 f, i64 s) {
  fp pat = bin[N - 1];
  i64 cnt = 0;
  for(auto t: G[v]) {
    if(t == f) {
      if(f == -1) {
        continue;
      }
      pat -= bin[s] - 1;
      cnt++;
    }
    else {
      pat -= bin[sum[t]] - 1;
      cnt++;
    }
  }
  pat -= 1;
  if(cnt == 1) {
    ans[v] = fp(0);
  }
  else {
    ans[v] = pat / bin[N];
  }

  for(auto t: G[v]) {
    if(t == f) continue;
    reroot(t, v, N - sum[t]);
  }
}


int main() {
  cin >> N;
  G.resize(N);
  ans.resize(N);
  bin.resize(N + 1);
  bin[0] = 1;
  rep(i,1,N + 1) {
    bin[i] = bin[i - 1] * fp(2);
  }
  rep(i,0,N - 1) {
    i64 a, b;
    cin >> a >> b;
    a--;
    b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  sum.resize(N);

  dfs(0, -1);
  reroot(0, -1, 0);

  fp res = fp(0);
  rep(i,0,N) res += ans[i];
  cout << res.value() << endl;
}


Measured memory_bytes: 25088