#include <bits/stdc++.h>

void solve() {
    using Data = std::array<long long, 4>;
    int n;
    std::cin >> n;
    std::vector<std::vector<int>> graph(n);
    for (int i = 0; i + 1 < n; i++) {
        int u, v;
        std::cin >> u >> v;
        u--;
        v--;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
    std::vector<Data> dp(n, {0, 0, 0, 0});
    long long ans = 0;
    auto dfs = [&](auto self, int u, int p) -> void {
        dp[u][0] = 1;
        for (auto v: graph[u]) {
            if (v == p) continue;
            self(self, v, u);
            for (int i = 0; i < 3; i++) {
                dp[u][i + 1] += dp[v][i];
            }
        }
        for (auto v: graph[u]) {
            if (v == p) continue;
            ans += (dp[u][1] - dp[v][0]) * dp[v][0];
            ans += (dp[u][2] - dp[v][1]) * dp[v][0];
            ans += (dp[u][1] - dp[v][0]) * dp[v][1];
        }
    };
    dfs(dfs, 0, 0);
    ans /= 2;
    for (int i = 0; i < n; i++) {
        for (int j = 1; j < 4; j++) {
            ans += dp[i][j];
        }
    }
    std::cout << ans << '\n';
}

int main() {
    std::cin.tie(0)->sync_with_stdio(0);
    std::cout << std::fixed << std::setprecision(16);
    int t = 1;

    while (t--) solve();
}