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

vector<ll> C,D;
void dfs(int n,vector<vector<int>> &G){
    C[n]=1;
    for(int v:G[n]){
        D[v]=D[n]+1;
        dfs(v,G);
        C[n]+=C[v];
    }
}

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N;
    cin>>N;
    vector<vector<int>> G(N);
    vector<bool> R(N,1);
    for(int i=0;i<N-1;i++){
        int a,b;
        cin>>a>>b;
        a--;b--;
        R[b]=0;
        G[a].push_back(b);
    }
    int r=0;
    for(int i=0;i<N;i++)if(R[i])r=i;
    C.assign(N,0);
    D.assign(N,0);
    dfs(r,G);
    ll an=0;
    ll mod=1e9+7;
    for(int i=0;i<N;i++){
        an+=(D[i]*C[i])%mod;
    }
    cout<<an%mod<<endl;
}