import sys
sys.setrecursionlimit(100050)
N = int(input())
AB = [list(map(int,input().split())) for _ in range(N-1)]
E = [[] for _ in range(N)]
for a, b in AB:
    a -= 1
    b -= 1
    E[a].append(b)
    E[b].append(a)
size = [0] * N
ans = 0
def dfs(x,p = -1):
    global ans
    ret = 0
    for y in E[x]:
        if y != p:
            tmp = dfs(y,x)
            ans += (N - tmp) * tmp
            ret += tmp
    ans += (ret + 1) * (N - ret - 1)
    ans += N
    return ret + 1

dfs(0)
print(ans)