#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<vector<int>> E(N);
  for (int i = 0; i < N - 1; i++){
    int A, B;
    cin >> A >> B;
    A--;
    B--;
    E[A].push_back(B);
    E[B].push_back(A);
  }
  vector<int> p(N, -1);
  vector<vector<int>> c(N);
  vector<int> b;
  queue<int> Q;
  Q.push(0);
  while (!Q.empty()){
    int v = Q.front();
    Q.pop();
    b.push_back(v);
    for (int w : E[v]){
      if (w != p[v]){
        p[w] = v;
        c[v].push_back(w);
        Q.push(w);
      }
    }
  }
  reverse(b.begin(), b.end());
  vector<long long> dp1(N, 1), dp2(N, 0);
  long long ans = 0;
  for (int v : b){
    int d = c[v].size();
    for (int w : c[v]){
      dp1[v] += dp1[w];
    }
    for (int w : c[v]){
      ans += (dp2[w] + dp1[w]) * (dp1[v] - dp1[w]) * 2;
    }
    for (int w : c[v]){
      dp2[v] += dp2[w] + dp1[w];
    }
  }
  ans += (long long) N * N;
  cout << ans << endl;
}