#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
struct edg{
	int x,y,val;
}r[100001];
int n;
char s[2];
vector<int>g[100001];
int dfx[100001],pos[100001],cnt;
int sz[100001],fa[100001];
int cl[100001],cr[100001];
int resp[100001][26];
void dfs0(int x,int fr){
	dfx[++cnt]=x;
	pos[x]=cnt;
	sz[x]=1;
	fa[x]=fr;
	int i;
	for(i=0;i<g[x].size();i++){
		int y=g[x][i];
		if(y==fr)continue;
		dfs0(y,x);
		sz[x]+=sz[y];
	}
}
int num,sum[100002];
void dfs1(int x){
	int i;
	for(i=0;i<g[x].size();i++){
		int y=g[x][i];
		if(y!=fa[x])dfs1(y);
	}
	if(!cl[x])return;
	num++;
	int p=cl[x],q=cr[x],l,r;
	if(p!=fa[x])sum[pos[p]]++,sum[pos[p]+sz[p]]--;
	else sum[1]++,sum[pos[x]]--,sum[pos[x]+sz[x]]++;
	if(q!=fa[x])sum[pos[q]]++,sum[pos[q]+sz[q]]--;
	else sum[1]++,sum[pos[x]]--,sum[pos[x]+sz[x]]++;
}
void solve(){
	int i,j;cnt=num=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++)g[i].resize(0);
	for(i=1;i<n;i++){
		int x,y;
		scanf("%d%d%s",&x,&y,s);
		int e=s[0]-'a';
		g[x].push_back(y);
		g[y].push_back(x);
		r[i]={x,y,e};
		
	}
	for(i=1;i<=n;i++)cl[i]=cr[i]=0;
	for(i=0;i<=n;i++)sum[i]=0;
	for(i=1;i<=n;i++)for(j=0;j<26;j++)resp[i][j]=0;
	for(i=1;i<n;i++){
		int x=r[i].x,y=r[i].y,e=r[i].val;
		if(!resp[x][e])resp[x][e]=y;
		else{
			if(cl[x]){
				printf("0\n");
				return;
			}
			cl[x]=y;
			cr[x]=resp[x][e];
		}
		if(!resp[y][e])resp[y][e]=x;
		else{
			if(cl[y]){
				printf("0\n");
				return;
			}
			cl[y]=x;
			cr[y]=resp[y][e];
		}
	}
	dfs0(1,0);
	dfs1(1);
	for(i=1;i<=n;i++)sum[i]+=sum[i-1];
	int res=0;
	for(i=1;i<=n;i++)if(sum[i]==num)res++;
	printf("%d\n",res);
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--)solve();
}