from collections import deque
import sys

input = sys.stdin.buffer.readline

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


# graph and n is necessary

# deque is necessary.
# n, graph, start is necessary
def BFS(start):
    dist = [-1] * n
    euler = []
    par = [-1] * n
    que = deque()
    que.append(start)
    dist[start] = 0
    while que:
        v = que.popleft()
        d = dist[v]
        euler.append(v)
        for u in graph[v]:
            if u == par[v]:
                continue
            par[u] = v
            if dist[u] == -1:
                dist[u] = d + 1
                que.append(u)
    return par, euler


par, euler = BFS(0)
dp1 = [0] * n
for v in euler[::-1]:
    dp1[v] = 1
    for u in graph[v]:
        if u == par[v]:
            continue
        dp1[v] += dp1[u]

dp2 = [0] * n
for v in range(n):
    dp2[v] = n - dp1[v]
ans = 0

for v in range(n):
    # 下側
    ans += 2 * (n - dp1[v]) * dp1[v]
    # for u in graph[v]:
    #     if u == par[v]:
    #         continue
    #     # 上側
    #     ans += dp2[u] * dp1[u]
    #     ans %= mod
    # # 自分中心
    ans += n
print(ans)