#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const ll inf=1e9+7;
const ll INF=1e18;

int MAX_N=1000020;

vvin baby(MAX_N);
vin d(MAX_N);

void deep(int root){//深さ
    queue<int> q;q.push(root);
    fill(all(d),0);
    while(q.size()){
        int p=q.front();q.pop();
        if(baby[p].size()==0)continue;
        for(auto b:baby[p]){
            d[b]=d[p]+1;
            q.push(b);
        }
    }
}

vin babynum(MAX_N,1);

void babycount(int v,int p){//自身を含む子孫の数
    if(baby[v].size()==0)return;
    for(auto b:baby[v]){
        if(b==p)continue;
        babycount(b,v);
        babynum[v]+=babynum[b];
    }
}

int main(){
    int n;cin>>n;
    vin a(n-1),b(n-1);
    vbo notroot(n+1,false);
    rep(i,n-1){
        cin>>a[i]>>b[i];
        baby[a[i]].push_back(b[i]);
        notroot[b[i]]=true;
    }
    int root;
    rep(i,n){
        if(!notroot[i+1]){
            root=i+1;
            break;
        }
    }
    deep(root);
    babycount(root,-1);
    ll ans=(ll)0;
    rep(i,n-1){
        ans+=((ll)(d[a[i]]+1)*(ll)babynum[b[i]])%inf;
        ans%=inf;
    }
    cout<<ans<<endl;
    //cout<<root<<endl;
    //rep(i,n)cout<<d[i+1]<<" ";cout<<endl;
    //rep(i,n)cout<<babynum[i+1]<<" ";cout<<endl;
}