#include<bits/stdc++.h>
#define MP make_pair
#define pb push_back
using namespace std;
const int N = 2e5 + 10;
typedef long long LL;
typedef pair< int, int > PII;
const LL mod = 998244353;
LL ans;
int T, col[N], n, sz[N], lst[N];
int del[N], del1[N];
vector< PII > E[N];
stack< int > cor[N];
inline LL Pow(LL x, LL y) {
	LL res = 1LL, k = x;
	while(y) {
		if(y & 1) res = res * k % mod;
		y >>= 1;
		k = k * k % mod;
	}
	return res;
}
void dfs0(int x, int fa) {
	sz[x] = 1;
	if(x == 1) {
		for(int i = 1; i <= n; i ++ ) cor[i].push(x);
	}
	for(auto edge : E[x]) {
		int v = edge.first, ide = edge.second;
		if(v == fa) continue;
		int c = col[ide];
		int tp = cor[c].top();
		cor[c].push(v);
		dfs0(v, x);
		sz[x] += sz[v];
		del[tp] += sz[v];
		if(tp == 1) del1[c] += sz[v];
		lst[v] = tp;
		cor[c].pop();
	}
	if(x == 1) {
		for(int i = 1; i <= n; i ++ ) cor[i].pop();
	}
}
void dfs(int x, int fa) {
	for(auto edge : E[x]) {
		int v = edge.first, ide = edge.second;
		int c = col[ide];
		int cnt1 = sz[v] - del[v];
		int u = lst[v];
		int cnt2 = sz[u] - (u != 1 ? del[u] : del1[c]);
		ans = (ans + 1LL * cnt1 * cnt2 % mod) % mod;
	}
}
int main() {
	scanf("%d", &T);
	while(T -- ) {
		scanf("%d", &n);
		for(int i = 1; i <= n; i ++ ) {
			vector< PII > tmp; swap(tmp, E[i]);
			del[i] = 0; del1[i] = 0;
		}
		for(int i = 1; i < n; i ++ ) {
			int u, v, c; scanf("%d%d%d", &u, &v, &c);
			E[u].pb(MP(v, i));
			E[v].pb(MP(u, i));
			col[i] = c;
		}
		ans = 0;
		dfs0(1, 0);
		dfs(1, 0);
		LL res = 0;
		for(int i = 1; i <= n; i ++ ) {
			LL p = 1LL * (i - 1) * i % mod;
			LL inv = 1LL * (n - 1) * n % mod;
			inv = Pow(inv, mod - 2LL);
			p = p * inv % mod;
			res ^= (ans * p % mod);
		}
		printf("%lld\n", res);
	}
	return 0;
}
/*
2
2
1 2 1
3
1 2 1
1 3 2
*/