#include <bits/stdc++.h>>
#define pt(sth) cout << sth << "\n"
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
static const ll INF=1e18;
static const ll MAX=101010;
//static const ll MOD=1e9+7;
//static const ll MOD=998244353;
//for(i=0;i<N;i++) cin>>a[i];

typedef vector<vector<vector<ll>>> v3D;
typedef vector<vector<ll>> v2D;
typedef vector<ll> v1D;


vector<ll> g[MAX];
vector<ll> nc;
vector<ll> pa;
ll dfs(ll u,ll p){
  pa[u]=p;
  if(u>0 and g[u].size()==1) return nc[u]=1;
  
  ll res=1;
  for(auto v:g[u]){
    if(v==p) continue;
    res+=dfs(v, u);
  }
  
  return nc[u]=res;
}

int main() {
  ll i, j, k;
  
  ll N;cin>>N;
  nc=vector<ll>(N,0);
  pa=vector<ll>(N,0);
  
  for(i=0;i<N-1;i++){
    ll a,b;cin>>a>>b;a--;b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  
  dfs(0,N);
  
  
  
  ll ans=0;
  for(ll u=0;u<N;u++){
    for(auto v:g[u]){
      if(v==pa[u]){
        ans+=(N-nc[u])*nc[u];
      }else{
        ans+=nc[v]*(N-nc[v]);
      }
    }
  }
  pt(ans+N*N);
  
  
}