#include <bits/stdc++.h>
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
using Int = long long;
const char newl = '\n';


template<typename T,T MOD = 1000000007>
struct Mint{
  static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator <(const Mint a)const{return v <a.v;}

  static Mint comb(long long n,int k){
    Mint num(1),dom(1);
    for(int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T,T MOD> constexpr T Mint<T, MOD>::mod;
template<typename T,T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}


template<typename F>
struct FixPoint : F{
  FixPoint(F&& f):F(forward<F>(f)){}
  template<typename... Args>
  decltype(auto) operator()(Args&&... args) const{
    return F::operator()(*this,forward<Args>(args)...);
  }
};
template<typename F>
inline decltype(auto) MFP(F&& f){
  return FixPoint<F>{forward<F>(f)};
}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n;
  cin>>n;
  vector<vector<int>> G(n);
  for(int i=1;i<n;i++){
    int a,b;
    cin>>a>>b;
    a--;b--;
    G[a].emplace_back(b);
    G[b].emplace_back(a);
  }

  using M = Mint<int>;
  const M inv2=M(2).inv();

  M ans{0};
  vector<M> dp1(n),dp2(n);
  MFP([&](auto dfs,int v,int p)->void{
    vector<M> cur(4,0);
    cur[0]=M(1);
    cur[1]=M(1);

    M sm{0};
    M sq{0};

    for(int u:G[v]){
      if(u==p) continue;
      dfs(u,v);

      sm+=dp1[u];
      sq+=dp1[u]*dp1[u];

      vector<M> nxt(4,0);

      nxt[0]+=cur[0];
      nxt[1]+=cur[0]*dp1[u];
      nxt[2]+=cur[0]*dp2[u]*inv2;

      nxt[1]+=cur[1];
      nxt[2]+=cur[1]*dp1[u];
      nxt[3]+=cur[1]*dp2[u]*inv2;

      nxt[2]+=cur[2];
      nxt[3]+=cur[2]*dp1[u];

      nxt[3]+=cur[3];
      swap(cur,nxt);
    }

    dp1[v]=cur[1]*M(1)*inv2;
    dp2[v]=cur[2]*M(2)*inv2;

    // 2 points (distinct)
    ans+=(sm*sm-sq)*inv2*M(6);
    ans+=sm*M(6);

    // 3 points (distinct)
    ans+=cur[3]*M(6);
  })(0,-1);
  ans*=M(2).pow(n-1);

  ans+=M(n)*M(2).pow(n-1);
  cout<<ans<<newl;
  return 0;
}