from collections import deque

n=int(input())
dep=[1]*n
v=[[] for i in range(n)]
ans=0
for i in range(n-1):
    a,b=map(int,input().split())
    a-=1;b-=1
    v[a].append(b);v[b].append(a)
f=deque([(0,0,0)])
while f:
    q,w,e=f.pop()
    if len(v[q])>e:
        f.append((q,w,e+1))
        if v[q][e]!=w:
            f.append((v[q][e],q,0))
    else:
        for i in v[q]:
            if i!=w:
                dep[q]+=dep[i]
        ans+=dep[q]*(n-dep[q])
print(ans*2+n*n)