#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(n); i++)


struct Edge{ int to; int h; };

int N;
vector<vector<Edge>> E;
vector<int> P;
vector<int> Z;

vector<int> H;
vector<int> SH;

vector<int> black_stack;
vector<int> prev_block;
vector<int> block_size;

void dfs(int p = 0, int pre = -1){

    int h = H[p];
    int prev_black_p = black_stack[h];
    block_size[p] = Z[p];
    prev_block[p] = prev_black_p;

    block_size[prev_black_p] -= Z[p];

    for(auto e : E[p]) if(e.to != pre){
        black_stack[h] = e.to;
        dfs(e.to,p);
        black_stack[h] = prev_black_p;
    }
}


int main(){
    cin >> N;
    E.resize(N);
    rep(i,N-1){
        int u,v,c; cin >> u >> v >> c; u--; v--;
        E[u].push_back({ v,c });
        E[v].push_back({ u,c });
    }

    vector<int> I = {0};
    P.assign(N,-1);
    H.assign(N,0);
    rep(i,I.size()){
        int p = I[i];
        for(auto e : E[p]){
            if(P[p] == e.to) continue;
            I.push_back(e.to);
            P[e.to] = p;
            H[e.to] = H[p] ^ e.h;
        }
    }
    Z.assign(N,1);
    for(int i=N-1; i>=1; i--) Z[P[I[i]]] += Z[I[i]];
    
    SH = H;
    sort(SH.begin(), SH.end());
    SH.erase(unique(SH.begin(),SH.end()),SH.end());
    for(int& h : H) h = lower_bound(SH.begin(),SH.end(),h) - SH.begin();
    
    black_stack.assign(N,0);
    rep(i,N) black_stack[i] = N + i;
    prev_block.assign(N,0);
    rep(i,N) prev_block[i] = N + H[i];
    block_size.assign(2*N,N);

    dfs();
    
    i64 ans = 0;
    for(int p=1; p<N; p++) ans += block_size[p];
    for(int p=1; p<N; p++) ans += block_size[prev_block[p]];
    cout << ans << endl;

    return 0;
}




struct ios_do_not_sync {
    ios_do_not_sync() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;