#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e5+10;
ll dp[maxn],ans,pan[maxn];
map<char,int> mp[maxn];
vector<pair<int,char>> e[maxn];
void dfs(int x,int fa){
	for(int i=0;i<e[x].size();i++){
		int to=e[x][i].first;
		if(to==fa) continue;
		else {
			dfs(to,x);
			dp[x]+=dp[to];
			char w=e[x][i].second;
			mp[x][w]++;
		}
	}
	for(auto it=mp[x].begin();it!=mp[x].end();it++){
		if(it->second>=2) {
			dp[x]++;
			pan[x]=1;
			break;
		}
	}
}
void solve(int x,int fa,int sum){
//	cout<<x<<" "<<dp[x]<<" "<<sum<<"\n";
	if(!dp[x]&&!sum) {
		ans++;
	}
	for(int i=0;i<e[x].size();i++){
		int to=e[x][i].first;
		if(to==fa) continue;
		else {
			ll tmpsum=sum,tmpdp=dp[to],ori1=pan[x],ori2=pan[to];
			tmpsum+=dp[x]-dp[to];
			char w=e[x][i].second;
			mp[to][w]++;
			mp[x][w]--;
			bool flag=true;
			for(auto it=mp[x].begin();it!=mp[x].end()&&flag;it++){
				if(it->second>=2) {
					flag=false;
				}
			}
			if(pan[x]&&flag) {
				tmpsum--;
				pan[x]=0;
			}
			flag=true;
			for(auto it=mp[to].begin();it!=mp[to].end()&&flag;it++){
				if(it->second>=2) {
					flag=false;
				}
			}
			if(!pan[to]&&!flag) {
				pan[to]=1;
				dp[to]++;
			}
			solve(to,x,tmpsum);
			dp[to]=tmpdp;
			mp[to][w]--;
			mp[x][w]++;
			pan[x]=ori1;
			pan[to]=ori2;
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;cin>>t;
	while(t--) {
		ans=0;
		int n;cin>>n;
		for(int i=1;i<=n;i++){
			e[i].clear();
			mp[i].clear();
			dp[i]=0;
			pan[i]=0;
		}
		for(int i=1;i<n;i++){
			int fr,to;cin>>fr>>to;
			char w;cin>>w;
			e[fr].push_back(pair<int,char>(to,w));
			e[to].push_back(pair<int,char>(fr,w));
		}
		dfs(1,0);
//		for(int i=1;i<=n;i++){
//			cout<<dp[i]<<" "<<pan[i]<<"\n";
//			for(auto it=mp[i].begin();it!=mp[i].end();it++){
//				cout<<it->first<<" "<<it->second<<" ";
//			}
//			cout<<"\n";
//		}
		solve(1,0,0);
		cout<<ans<<"\n";
	}
}
/*
  1
  6
  3 1 a
  3 2 a
  3 4 b
  4 5 c
  4 6 d
 */