#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
vector<int> g[1000010];
int deg[1000010];
int d[1000010], cnt[1000010];
ll ans;
void dfs(int x, int p){
    cnt[x]=1;
    for(auto y:g[x]){
        d[y]=d[x]+1;
        dfs(y, x);
        cnt[x]+=cnt[y];
        (ans+=(ll)(d[x]+1)*cnt[y])%=MOD;
    }
}
int main()
{
	int n; cin>>n;
    for(int i=0; i<n-1; i++){
        int a, b; cin>>a>>b;
        a--; b--;
        g[a].push_back(b);
        deg[b]++;
    }
    int r=0;
    for(int i=0; i<n; i++) if(deg[i]==0) r=i;
    dfs(r, -1);
    cout<<ans<<endl;
	return 0;
}