#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
// const ll mod=998244353;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%mod;
    a=a*a%mod;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}
template<class M>
struct rerooting{
  size_t N;
  M ME;
  vector<vector<int>> g;
  vector<vector<M>> v,l,r;
  using funcM=function<M(M,M)>;
  using funcR=function<M(M)>;
  funcM merge;
  funcR resact;
  vector<int> vis,parid,solvelist;
  rerooting(vector<vector<int>> &G,M MI,funcM Merge,funcR Resact):N(G.size()),ME(MI),g(G),v(N),l(N),r(N),merge(Merge),resact(Resact),vis(N,0),parid(N){
  }
  M dfs(int id,int p){
    int i;
    parid[id]=p;
    vis[id]=1;
    v[id].resize(g[id].size());
    M res=ME;
    rep(i,g[id].size()){
      if(vis[g[id][i]]){
        vis[id]+=i;
        continue;
      }
      solvelist.eb(g[id][i]);
      v[id][i]=dfs(g[id][i],i);
      res=merge(res,v[id][i]);
    }
    return resact(res);
  }
  M call(int i,int j){
    M res=ME;
    if(j)res=merge(l[i][j-1],res);
    if(j+1!=(int)g[i].size())res=merge(res,r[i][j+1]);
    return resact(res);
  }
  vector<vector<M>> solve(){
    int i;
    dfs(0,-1);
    r[0]=l[0]=v[0];
    rep1(i,g[0].size())l[0][i]=merge(l[0][i-1],l[0][i]);
    brep(i,(int)g[0].size()-1)r[0][i]=merge(r[0][i],r[0][i+1]);
    for(int x:solvelist){
      v[x][vis[x]-1]=call(g[x][vis[x]-1],parid[x]);
      r[x]=l[x]=v[x];
      rep1(i,g[x].size())l[x][i]=merge(l[x][i-1],l[x][i]);
      brep(i,(int)g[x].size()-1)r[x][i]=merge(r[x][i],r[x][i+1]);
    }
    return v;
  }
};
int main(){
  // startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,N,a,b,ans=0,res;
  cin>>N;
  vector<vector<int>> g(N);
  rep1(i,N){
    cin>>a>>b;
    --a;--b;
    g[a].eb(b);
    g[b].eb(a);
  }
  rerooting<ll> tree(g,0,[](ll a,ll b){return a+b;},[](ll a){return ++a;});
  mat v=tree.solve();
  rep(i,N){
    if(v[i].size()==1)continue;
    res=modpow(2,N-1)+v[i].size()-1;
    for(ll x:v[i])(res+=mod-modpow(2,x))%=mod;
    (ans+=res)%=mod;
  }
  print(moddevide(ans,modpow(2,N)));
}

Measured memory_bytes: 79988