#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)

int N;
vector<vector<pair<int,int>>> E;
vector<int> P,Z,H,SH,black_stack,prev_block,block_size,I;

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,d] : E[p]) if(e != pre){
		black_stack[h] = e;
		dfs(e,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 });
	}

	I.push_back(0);
	P.assign(N,-1);
	H.assign(N,0);
	rep(i,I.size()){
		int p = I[i];
		for(auto [e,h] : E[p]){
			if(P[p] == e) continue;
			I.push_back(e);
			P[e] = p;
			H[e] = H[p] ^ 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();
	
	long long ans = 0;
	for(int p=1; p<N; p++) ans += block_size[p] + block_size[prev_block[p]];
	cout << ans << endl;

	return 0;
}