using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => int.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var map = NArr(n - 1);
        var tree = new List<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0] - 1].Add(edge[1] - 1);
            tree[edge[1] - 1].Add(edge[0] - 1);
        }
        DFS(0, -1, tree);
        WriteLine(ans);
    }
    static long ans = 0;
    static int DFS(int cur, int prev, List<int>[] tree)
    {
        var sum = 1;
        var list = new List<int>();
        foreach (var next in tree[cur])
        {
            if (prev == next) continue;
            list.Add(DFS(next, cur, tree));
            sum += list[^1];
        }
        list.Add(tree.Length - sum);
        foreach (var li in list)
        {
            ans += (long)li * (tree.Length - li);
        }
        ans += tree.Length;
        return sum;
    }
}