#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

using mll=atcoder::static_modint<1000000007>;

int N;
vector<vector<int>> E;
vector<int> gI,gP;
vector<ll> Z;

int main(){
  scanf("%d",&N);
  E.resize(N);
  rep(i,N-1){
    int u,v; scanf("%d%d",&u,&v); u--; v--;
    E[u].push_back(v);
    E[v].push_back(u);
  }
  gP.assign(N,-1);
  {
    queue<int> Q; Q.push(0);
    while(Q.size()){
      int p=Q.front(); Q.pop();
      gI.push_back(p);
      for(int e:E[p]) if(e!=gP[p]){
        gP[e]=p;
        Q.push(e);
      }
    }
  }
  Z.assign(N,1);
  for(int i=N-1; i>=0; i--){
    int p=gI[i];
    for(int e:E[p]) if(gP[p]!=e) Z[p]+=Z[e];
  }
  ll ans=0;
  rep(p,N){
    ans+=N;
    ans+=Z[p]*(N-Z[p]);
    for(int e:E[p]) if(gP[p]!=e) ans+=(N-Z[e])*Z[e];
  }
  printf("%lld\n",ans);
  return 0;
}