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

#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define Sz(x) (int)(x).size()
#define bit(x) (1ll << (x))
using ll = long long;
using db = double;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vd = vector<db>;
mt19937 mrand(time(0));

void solve(void)
{
	int n;
	cin >> n;
	vector<vector<array<int, 2>>> e(n + 2);
	for (int i = 1; i < n; i++)
	{
		int u, v;
		char c;
		cin >> u >> v >> c;
		e[u].pb({v, c - 'a'});
		e[v].pb({u, c - 'a'});
	}

	vii son(n + 2, vi(27));
	vl f(n + 2);
	function<void(int, int)> up = [&](int u, int fa)
	{
		for (auto [v, c] : e[u])
			if (v != fa)
			{
				up(v, u);
				f[u] += son[u][c];
				f[u] += f[v];
				son[u][c]++;
			}
	};

	function<void(int, int, int)> down = [&](int u, int fa, int fc)
	{
		if (u != 1)
		{
			f[u] = f[fa] - (son[fa][fc] - 1) + son[u][fc];
			son[u][fc]++;
		}
		for (auto [v, c] : e[u])
			if (v != fa)
				down(v, u, c);
	};
	up(1, 0);

	// cerr << son[3][0] << "\n";
	down(1, 0, 0);
	int ans = 0;
	for (int i = 1; i <= n; i++)
		ans += f[i] == 0;
	cout << ans << "\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	// cout << fixed << setprecision(10);

	int T = 1;
	cin >> T;
	for (int i = 1; i <= T; i++)
	solve();

	return 0;
}