#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

vl par(1010101,-1);
vl ch(1010101,1);
vvl G(1010101);

ll dfs(ll u){
    for(auto v : G[u]){
        par[v] = par[u] + 1;
        ch[u] += dfs(v);
    }
    return ch[u];
}

int main(){
    ll n; cin >> n;
    vpl edge(n-1);
    vl indeg(n,0);
    rep(i,n-1){
        ll u,v; cin >> u >> v; u--; v--;
        G[u].push_back(v);
        edge[i] = P(u,v);
        indeg[v]++;
    }
    ll s = 0;
    rep(i,n){
        if(!indeg[i]) s = i;
    }
    par[s] = 1;
    dfs(s);
    ll ans = 0;
    rep(i,n-1){
        ll u = edge[i].first;
        ll v = edge[i].second;
        ans += par[u] * ch[v] % mod;
        ans %= mod;
    }
    cout << ans << "\n";
}