#include <bits/stdc++.h>
#define rep(i,n) for(ll i = 0; i < n; i++) //[0,n)
#define srep(i,a,b) for(ll i = a; i < b; i++) //[a,b)
#define all(A) (A).begin(),(A).end()
#define rall(A) (A).rbegin(),(A).rend()
#define pmt(A) next_permutation(all(A))
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;
using pq = priority_queue<P,vector<P>,greater<P>>;
const ll inf = 1LL<<60;
const int iinf = (int)1e9+1;
const int mod9 = 998244353;
const int mod1 = 1000000007;
struct Edge { int to; long long cost; int from; };
bool compe(const Edge &e,const Edge &e2){ return e.cost < e2.cost; }
using Graph = vector<vector<int>>;
using SGraph = vector<set<ll>>;
template <class T>
int siz(T& a){return (int)a.size();}
ll squa(ll a){ return a*a; }
ll mceil(ll a,ll b){ return (a+b-1)/b; }

ll dp[202020][5];
ll mx[202020];
ll ans = 0;
void dfs(const Graph &G,int v,int pre = -1){
    dp[v][0] = 1;
    mx[v] = 1;
    for(auto nv : G[v]){
        if(nv == pre) continue;
        dfs(G,nv,v);

        rep(x,mx[v]) rep(y,mx[nv]){
            if(x+y+1 > 3) break;
            ans += dp[v][x]*dp[nv][y];
        }
        rep(x,min(3LL,mx[nv])) dp[v][x+1] += dp[nv][x];
        mx[v] = min(4LL,max(mx[v],mx[nv]+1));
    }

}

int main(void){
    int N; cin >> N;
    Graph G(N);
    vector<int> U(N),V(N);
    rep(i,N-1){
        int u,v; cin >> u >> v;
        u--; v--;
        U[i] = u,V[i] = v;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    dfs(G,0);
    cout << ans;
}