import sys
input = sys.stdin.readline

ret = 0

def main():
    N = int(input())
    to = [[] for _ in range(N)]

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


    def dfs(now: int, prv: int) -> int:
        global ret
        nexts = to[now]
        subtree_size = 1
        for nxt in nexts:
            if nxt != prv:
                tmp = dfs(nxt, now)
                ret += tmp * (N - tmp) * 2
                subtree_size += tmp
        ret += N
        return subtree_size

    dfs(0, -1)
    print(ret)


main()