#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
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; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
const int nmx=100005;
vector<vector<int>> e(nmx);
vector<ll> c(nmx);
ll ans=0;
ll n;
void dfs(int cur,int pre=-1){
    for(int to:e[cur]){
        if(to==pre) continue;
        dfs(to,cur);
        ans+=c[to]*(n-c[to]);
        c[cur]+=c[to];
    }
    c[cur]++;
    ans+=c[cur]*(n-c[cur]);
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    REP(i,n-1){
        int a,b;cin >> a >> b;
        a--,b--;
        e[a].push_back(b);
        e[b].push_back(a);
    }
    dfs(0);
    cout << ans+n*n << endl;
}