import sys
sys.setrecursionlimit(10 ** 6)
n = int(input())
G = [[] for i in range(n)]
for _ in range(n - 1):
    a, b = map(int, input().split())
    G[a - 1].append(b - 1)
    G[b - 1].append(a - 1)
ans = 0
def dfs(now, prev):
    global ans
    res = 1
    for nex in G[now]:
        if nex == prev: continue
        tmp = dfs(nex, now)
        ans += tmp * (n - tmp) * 2
        res += tmp
    ans += n
    return res
dfs(0, -1)
print(ans)