N = int(input())
G = [[] for _ 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(v, pv):
    global ans
    cnt = 1
    for nv in G[v]:
        if nv == pv:
            continue
        chi = dfs(nv, v)
        ans += (N - chi) * chi
        cnt += chi
    ans += cnt * (N - cnt)
    ans += N
    return cnt


dfs(0, -1)
print(ans)