#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;

const int MAXN = 1e3 + 10;

int n, m, eid;
char str[MAXN];
string Str;
map<string, int> M[MAXN];
vector<int> G[MAXN];
set<int> Child[MAXN], Front;
bool used[MAXN];

int dfs(int k) { 
	if (!used[k]) return 1;
	else {
		int ans = 0;
		for (auto x: Child[k]) {
			ans += dfs(x);
		}
		return ans;
	}
}

int main() {
	int t;
	scanf("%d", &t);
	for (int u = 1; u <= t; u++) {
		for (int i = 0; i < MAXN; i++) used[i] = false;
		eid = 0;
		scanf("%d %d", &n, &m);
		for (int i = 0; i < MAXN; i++)
			M[i].clear();
		for (int i = 1; i <= n + m; i++) G[i].clear();
		for (int i = 1; i <= n; i++) {
			int cnt = 0;
			scanf("%s", str + 1);
			int len = strlen(str + 1);
			Str = "";
			bool flag = true;
			for (int j = 1; j <= len; j++) {
				if ('a' <= str[j] && str[j] <= 'z') {
					Str = Str + str[j];
				} else {
					cnt++;
					if (flag) {
						if (M[cnt][Str] == 0) {
							M[cnt][Str] = ++eid;
							flag = false;
						}
						G[i].push_back(M[cnt][Str]);
					} else {
						G[i].push_back(++eid);
						M[cnt][Str] = eid;
					}
					Str = "";
				}
			}
			cnt++;
			if (flag) {
				if (M[cnt][Str] == 0) {
					M[cnt][Str] = ++eid;
					flag = false;
				}
				G[i].push_back(M[cnt][Str]);
			} else {
				G[i].push_back(++eid);
				M[cnt][Str] = eid;
			}
		}
		for (int i = n + 1; i <= n + m; i++) {
			int cnt = 0;
			scanf("%s", str + 1);
			int len = strlen(str + 1);
			Str = "";
			bool flag = true;
			for (int j = 1; j <= len; j++) {
				if ('a' <= str[j] && str[j] <= 'z') {
					Str = Str + str[j];
				} else {
					cnt++;
					if (flag) {
						if (M[cnt][Str] == 0) {
							M[cnt][Str] = ++eid;
							flag = false;
						}
						G[i].push_back(M[cnt][Str]);
					} else {
						G[i].push_back(++eid);
						M[cnt][Str] = eid;
					}
					Str = "";
				}
			}
			cnt++;
			if (flag) {
				if (M[cnt][Str] == 0) {
					M[cnt][Str] = ++eid;
					flag = false;
				}
				G[i].push_back(M[cnt][Str]);
			} else {
				G[i].push_back(++eid);
				M[cnt][Str] = eid;
			}
		}
//		for (int i = 1; i <= n + m; i++) {
//			for (int j = 0; j < G[i].size(); j++)
//				cout << G[i][j] << " ";
//			cout << endl;
//		}
		for (int i = 0; i < MAXN; i++) Child[i].clear();
		Front.clear();
		for (int i = 1; i <= n; i++) {
			Front.insert(G[i][0]);
			for (int j = 0; j < G[i].size() - 1; j++)
				Child[G[i][j]].insert(G[i][j + 1]); 
		}
		for (int i = n + 1; i <= n + m; i++) {
			for (int j = 0; j < G[i].size() - 1; j++)
				used[G[i][j]] = true;
			used[G[i][G[i].size() - 1]] = true;
		}
		int Ans = 0;
		for (auto x:Front) {
			Ans += dfs(x);
		} 
		printf("%d\n", Ans);
	}
	return 0;
}