def tree_dfs(g):
    order = []
    s = [0]
    d = [0] * n
    while s:
        p = s.pop()
        d[p] = 1
        order.append(p)
        for node in g[p]:
            if d[node] == 0:
                s.append(node)
    return order

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)
order = tree_dfs(g)
d = [0] * n
for v in order[::-1]:
    d[v] = 1
    for node in g[v]:
        if d[node] > 0:
            d[v] += d[node]
d1 = [0] * n
ans = 0
for v in order[::-1]:
    d1[v] = 1
    t = 1
    for node in g[v]:
        if d1[node]:
            ans += d[node] * (n - d[node])
            t += d[node]
    ans += (n - t) * t
print(ans + n * n)