#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

int n;

vector<int> edges[1000000];
int par[1000000];

long long ret = 0;
const long long MOD = 1e9 + 7;

void dfs(int v, int acc = 0, int d = 0) {
  acc += d; acc %= MOD;
  ret += acc; ret %= MOD;
  for (int w: edges[v]) {
    if (w == par[v])
      continue;
    dfs(w, acc, d+1);
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> n;
  memset(par, -1, sizeof(par));
  
  REP (i, n-1) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    par[b] = a;
    edges[a].push_back(b);
    edges[b].push_back(a);
  }

  int root = -1;
  REP (i, n) if (par[i] == -1) root = i;
  
  dfs(root);

  cout << ret << endl;
  
  return 0;
}