#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 1000006
int n, m, cnt;
map<string, int> vis;
int can[maxn], cost[maxn];
vector<int> E[1000005];
int get_id(string &s){
	if(vis.count(s)) return vis[s];
	return vis[s] = ++ cnt;
}
void dfs(int u = 1) {
	for (auto v : E[u]) dfs(v), can[u] |= can[v];
	// cout << u<<" "<< cost[u]<<endl;
	if(!can[u]) cost[u] = 1;
	else {
		cost[u] = 0;
		for (auto v : E[u]) {
			cost[u] += cost[v];	
		}
	}
}
void solve(){
	cnt = 1;
	cin >> n>> m;
	for (int i = 1;i <= n;i ++){
		string s, tmp;
		cin >> s;
		s += '/';
		int last = 1;
		for (auto c : s){
			if(c == '/'){
				E[last].push_back(get_id(tmp));
				last = get_id(tmp);
			}
			tmp += c;
		}
	}
	
	for (int i = 1;i <= m;i ++){
		string s, tmp;
		cin >> s;
		s = s + '/';
		int last = 1;
		for (auto c : s){
			if(c == '/'){
				E[last].push_back(get_id(tmp));
				last = get_id(tmp);
			}
			tmp += c;
		}
		can[last] = 1;
	}
	for (int i = 1;i <= cnt;i ++) {
		sort(E[i].begin(), E[i].end());
		E[i].erase(unique(E[i].begin(), E[i].end()), E[i].end());
	}
	dfs(1);
	int ans = 0;
	for (auto v : E[1]) ans += cost[v];
	cout << ans<<endl;
	for (int i = 1;i <= cnt;i ++) {
		E[i].clear();
		can[i] = 0;
		cost[i] = 0;
	}
	vis.clear();
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T = 1;
	cin >> T;
	while (T --)
		solve();
}