#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcount(x)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
int n;
vector<vector<int>>to;
vector<ll>dp,sum;
ll ans=0;
void dfs(int x,int p){
  dp[x]=1;
  sum[x]=0;
  for(auto i:to[x])if(i!=p){
    dfs(i,x);
    dp[x]+=dp[i];
    sum[x]+=sum[i];
  }
  sum[x]+=dp[x];
}
void dfs2(int x,int p){
  for(auto i:to[x]){
    ans+=sum[i];
  }
  ans+=n;
  debug(x,dp,sum);
  debug(x,ans);
  int s=to[x].size();
  vector<ll>dpleft(s),dpright(s),sumleft(s),sumright(s);
  rep(i,s){
    dpleft[i]=dpright[i]=dp[to[x][i]];
    sumleft[i]=sumright[i]=sum[to[x][i]];
  }
  rep(i,s-1){
    dpleft[i+1]+=dpleft[i];
    sumleft[i+1]+=sumleft[i];
  }
  for(int i=s-1;i>=1;i--){
    dpright[i-1]+=dpright[i];
    sumright[i-1]+=sumright[i];
  }
  rep(i,s)if(to[x][i]!=p){
    dp[x]=1,sum[x]=0;
    if(i)dp[x]+=dpleft[i-1],sum[x]+=sumleft[i-1];
    if(i!=s-1)dp[x]+=dpright[i+1],sum[x]+=sumright[i+1];
    sum[x]+=dp[x];
    dfs2(to[x][i],x);
  }
}
void SOLVE(){
  cin>>n;
  to.resize(n);
  rep(i,n-1){
    int a,b;
    cin>>a>>b;
    a--,b--;
    to[a].push_back(b);
    to[b].push_back(a);
  }
  dp.resize(n),sum.resize(n);
  dfs(0,-1);
  dfs2(0,-1);
  cout<<ans<<endl;
}