N = int(input())
G = [[] for _ in range(N+1)]

for _ in range(N-1):
    a,b = map(int,input().split())
    G[a].append(b)
    G[b].append(a)

import sys
sys.setrecursionlimit(10 ** 6)
ans = 0
def dfs(now = 1,parent = 0):
    global ans
    l = []
    for v in G[now]:
        if v == parent:continue
        l.append(dfs(v,now))
    a = N - sum(l) - 1
    ans += a * (N - a)
    for k in l:
        ans += k * (N - k)
    ans += N
    return sum(l) + 1
dfs()
print(ans)