#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
//*
#include <atcoder/all>
using namespace atcoder;
template <class T, internal::is_static_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_static_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " "); cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

int main()
{
  ll N;
  cin >> N;
  vector<vector<ll>> G(N + 3);
  for (ll i = N; i < N + 2; i++)
  {
    G.at(i).push_back(i + 1);
  }
  G.at(N + 2).push_back(0);

  for (ll i = 0; i < N - 1; i++)
  {
    ll u, v;
    cin >> u >> v;
    u--, v--;
    G.at(u).push_back(v);
    G.at(v).push_back(u);
  }

  vector<ll> par(N + 3, -1), dep(N + 3, 0);
  auto dfs = [&](auto self, ll v, ll pv) -> void
  {
    par.at(v) = pv;
    dep.at(v) = (pv < 0 ? 0 : dep.at(pv) + 1);
    for (auto nv : G.at(v))
    {
      if (nv == pv)
        continue;
      self(self, nv, v);
    }
  };
  dfs(dfs, N, -1);

  // cnt[v][d] := v から下に距離 d の頂点の個数
  vector<vector<ll>> cnt(N + 3, vector<ll>(4, 0));
  for (ll v = 0; v < N + 3; v++)
  {
    ll p = v;
    for (ll k = 0; k < 4; k++)
    {
      if (p < 0)
        break;
      cnt.at(p).at(k)++;
      p = par.at(p);
    }
  }
  /*
  printvec2(cnt);
  //*/

  ll ans = 0;
  for (ll v = 0; v < N; v++)
  {
    ll p = v;
    for (ll k = 3; k >= 0; k--)
    {
      if (p < 0)
        break;
      ans += cnt.at(p).at(k);
      if (k > 0)
        ans += cnt.at(p).at(k - 1);
      p = par.at(p);
    }
    ans--;
    ans -= max(0LL, 6 - dep.at(v));
  }
  cout << ans / 2 << endl;
}