#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+10; 
int n;
int cnt;
int vis[N];
int vis1[N];
struct edge{
	int to,nex;
	char w;
}e[N];
int head[N];
bool flag[27];
void add_edge(int x,int y,char c)
{
	cnt++;
	e[cnt].to = y;
	e[cnt].w = c;
	e[cnt].nex = head[x];
	head[x] = cnt;
}
int bfs(int x)
{
	memset(vis1,0,sizeof(vis1));
	queue<int>q;
	vis1[x] = 1;
	q.push(x);
	while(!q.empty())
	{
		int tem = q.front();
		q.pop();
		memset(flag,0,sizeof(flag));
	for(int i = head[tem] ; i ; i = e[i].nex)
	{
		int y = e[i].to;
		if(vis[y]) return 0;
		if(flag[e[i].w-'a'+1]) return 0;
		flag[e[i].w-'a'+1]=1;
	}
	}
	return 1;
}

void slove()
{
	memset(vis,0,sizeof(vis));
	cnt = 0;
	int ans = 0;
	cin>>n;
	for(int i = 1 ; i < n ; i++ )
	{
		int x,y;
		char c;
		cin>>x>>y>>c;
		add_edge(x,y,c);
		add_edge(y,x,c);
	}
	for(int i = 1 ; i <= n ; i++ )
	{
		if(bfs(i)==0) vis[i] = 1;
		if(bfs(i)) 
		{
//			cout<<i<<" ";
			ans++;
		}
	}
//	for(int i = 1 ; i <= n ; i++ )
//	cout<<head[i]<<" ";
	cout<<ans<<endl;
}
int main()
{
	int tcase;
	cin>>tcase;
	while(tcase--)
	{
		slove();
	}
	return 0;
}
/*
2
6
3 1 a
3 2 a
3 4 b
4 5 c
4 6 d
*/