#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int N = 100447;
LL a[N];
LL ans[N];
vector<PII> g[N];

void dfs(int v, int par = -1)
{
	vector<int> cnt(26);
	for (auto [to, c] : g[v])
	{
		if (to != par)
			dfs(to, v);
		cnt[c]++;
	}
	int two = -1;
	FOR (i, 0, 26)
	{
		if (cnt[i] > 2)
		{ 
			a[0] = N;
			return;
		}
		if (cnt[i] == 2)
		{
			if (two == -1) two = i;
			else a[0] = N;
		}
	}
	if (two == -1) return;
	bool is_par = 0;
	for (auto [to, c] : g[v]) if (to == par && c == two) is_par = 1;
	if (is_par)
	{
		a[v]++;
		for (auto [to, c] : g[v]) if (c == two && to != par) a[to]--;
	}
	else
	{
		a[0]++;
		for (auto [to, c] : g[v]) if (c == two) a[to]--;
	}
}

void dfs2(int v, int par = -1, LL x = 0)
{
	x += a[v];
	ans[v] = x;
	for (auto [to, c] : g[v])
		if (to != par)
			dfs2(to, v, x);
}

void solve()
{
	int n;
	cin >> n;
	FOR (i, 0, n - 1)
	{
		int u, v;
		char ch;
		cin >> u >> v >> ch;
		u--, v--;
		g[u].PB({v, ch - 'a'});
		g[v].PB({u, ch - 'a'});
	}
	dfs(0);
	dfs2(0);
	int res = 0;
	FOR (i, 0, n) 
	{
		//cerr << i << ' ' << ans[i] << ' ' << a[i] << '\n';
		if (ans[i] == 0) 
			res++;
	}
		
	cout << res << '\n';
	FOR (i, 0, n) 
	{
		g[i].clear();
		a[i] = 0;
		ans[i] = 0;
	}
	
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	
	return 0;
}