#include<bits/stdc++.h>
#define ll long long
#define mod 998244353
#define N 200005
using namespace std;
inline char nc(){
	static char buf[1000000],*p=buf,*q=buf;
	return p==q&&(q=(p=buf)+fread(buf,1,1000000,stdin),p==q)?EOF:*p++;
}
inline ll read(){
	ll res = 0;
	char c = nc();
	while(c<'0'||c>'9')c=nc();
	while(c<='9'&&c>='0')res=res*10+c-'0',c=nc();
	return res;
}
char obuf[1<<21],*p3=obuf; 
inline void pc(char c){ 
	p3-obuf<=(1<<20)?(*p3++=c):(fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=c); 
} 
inline void write(ll x){ 
	if(x<0) pc('-'),x=-x; 
	if(x>9) write(x/10); 
	pc(x%10+'0'); 
}
vector<ll> op[N],sta[N],w[N];
ll n,jc[N],inv[N],i,e[N],sum,cnt[N],son[N],x,y,z,cnt2[N];
inline ll qmi(ll a,ll b,ll p){
	ll res = 1%p,t = a;
	while(b){
		if(b&1) res=res*t%p;
		t=t*t%p;
		b>>=1;
	}
	return res;
}
inline ll C(ll n,ll m){
	if(n<m) return 0;
	return jc[n]*inv[m]%mod*inv[n-m]%mod;
}
inline void init(ll x,ll fa){
	son[x] = 1;
	for(ll i=0;i<op[x].size();i++){
		if(op[x][i]==fa) continue;
		init(op[x][i],x);
		son[x] += son[op[x][i]];
	}
	cnt[x] = son[x];
}
inline void dfs(ll x,ll fa){
	for(ll i=0;i<op[x].size();i++){
		if(op[x][i]==fa) continue;
		ll pos = sta[w[x][i]][sta[w[x][i]].size()-1];
		if(pos!=1) cnt[pos] -= son[op[x][i]];
		else cnt2[w[x][i]] -= son[op[x][i]];
		sta[w[x][i]].push_back(op[x][i]);
		dfs(op[x][i],x);
		sta[w[x][i]].pop_back();
	}
}
inline void dfs2(ll x,ll fa){
	for(ll i=0;i<op[x].size();i++){
		if(op[x][i]==fa) continue;
		ll pos = sta[w[x][i]][sta[w[x][i]].size()-1];
		if(pos!=1) sum = (sum+cnt[op[x][i]]*cnt[pos])%mod;
		else sum = (sum+cnt[op[x][i]]*cnt2[w[x][i]])%mod;
		sta[w[x][i]].push_back(op[x][i]);
		dfs2(op[x][i],x);
		sta[w[x][i]].pop_back();
	}
}
inline void solve(){
	sum=0;
	n=read();
	for(ll i=1;i<n;i++){
		x=read(),y=read(),z=read();
		op[x].push_back(y),w[x].push_back(z);
		op[y].push_back(x),w[y].push_back(z);
	}
	for(ll i=1;i<=n;i++) sta[i].push_back(1),cnt2[i]=n;
	init(1,-1);
	dfs(1,-1);
	dfs2(1,-1);
	e[1]=0,e[2]=sum;
	for(ll i=3;i<=n;i++) e[i]=e[2]*C(n-2,i-2)%mod;
	for(ll i=1;i<=n;i++) e[i]=e[i]*qmi(C(n,i),mod-2,mod)%mod;
	for(ll i=1;i<=n;i++) e[i]^=e[i-1];
	write(e[n]),pc('\n');
}
inline void clear(){
	for(ll i=1;i<=n;i++) op[i].clear(),w[i].clear();
	for(ll i=1;i<=n;i++) sta[i].clear();
	for(ll i=1;i<=n;i++) cnt[i]=0,cnt2[i]=0;
}
int main(){
	jc[0]=1;
	for(i=1;i<=2e5;i++) jc[i]=jc[i-1]*i%mod;
	inv[200000]=qmi(jc[200000],mod-2,mod);
	for(i=2e5;i>=1;i--) inv[i-1]=inv[i]*i%mod;
	ll T;
	T=read();
	while(T--) solve(),clear();
	return fwrite(obuf,p3-obuf,1,stdout),0;
}