import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

n = int(input())
g = [[] for i in range(n)]
for i in range(n-1):
    a, b = map(int, input().split())
    a, b = a-1, b-1
    g[a].append(b)
    g[b].append(a)

s = []
s.append(0)
parent = [-1]*n
order = []
while s:
    v = s.pop()
    order.append(v)
    for u in g[v]:
        if u == parent[v]:
            continue
        s.append(u)
        parent[u] = v
order.reverse()
dp = [1]*n
for v in order:
    if parent[v] != -1:
        dp[parent[v]] += dp[v]
#print(dp)

ans = 0
for v in range(n):
    for u in g[v]:
        if u == parent[v]:
            t = dp[v]*(n-dp[v])
            ans += dp[v]*(n-dp[v])
        else:
            t = (n-dp[u])*dp[u]
            ans += (n-dp[u])*dp[u]
        #print(v, u, t)
ans += n*n
print(ans)