#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
//#define mod 998244353
#define FS fixed<<setprecision(15)
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
template<class T> using V=vector<T>;
using Graph = vector<vector<int>>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline void out(T a){ cout << a << '\n'; }
void YN(bool ok){if(ok) cout << "Yes" << endl; else cout << "No" << endl;}
//void YN(bool ok){if(ok) cout << "YES" << endl; else cout << "NO" << endl;}


const ll INF=1e18;
const int mx=200005;

V<V<ll>> G;
V<ll> depth;
V<ll> cnt;

void dfs(ll v,ll p,ll d){
    depth[v]=d;
    for(ll u:G[v]){
        if(u==p) continue;
        dfs(u,v,d+1);
        cnt[v]+=cnt[u];
    }
    cnt[v]++;
}

int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    int n;
    cin>>n;
    G.resize(n);
    cnt.resize(n);
    depth.resize(n);
    V<int> deg(n,0);
    int root;
    rep(i,n-1){
        int a,b;
        cin>>a>>b;
        a--;b--;
        G[a].pb(b);
        deg[b]++;
        //G[b].pb(a);
    }
    rep(i,n) cnt[i]=0;
    rep(i,n){
        if(deg[i]==0){
            root=i;
            break;
        }
    }
    dfs(root,-1,0);
    ll ans=0;
    rep(i,n) ans=(ans+(depth[i]+1)*(cnt[i]-1)%mod)%mod;
    out(ans);
}