n=int(input())
ab=[list(map(int,input().split())) for _ in range(n-1)]
ki=[[] for _ in range(n)]
for a,b in ab:
  a,b=a-1,b-1
  ki[a].append(b)
  ki[b].append(a)
# tree_order
todo=[[0,-1]]
order=[]
while todo:
  v,p=todo.pop()
  order.append(v)
  for nv in ki[v]:
    if nv!=p:
      todo.append([nv,v])
order.reverse()
to_ary=[1]*n
seen=[0]*n
ans=[0]*n
for v in order:
  seen[v]=1
  for nv in ki[v]:
    if seen[nv]==0:
      ans[v]+=(n-to_ary[v])*(to_ary[v]) # 根の個数 x サイズ
      to_ary[nv]+=to_ary[v]
    else:
      ans[v]+=(n-to_ary[nv])*(to_ary[nv])
  ans[v]+=n
print(sum(ans))