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

#define PII pair<int,int>
#define pb push_back
#define fi first
#define se second

void solve()
{
	vector<vector<int>> v(10000);
	map<string,int> rt;
	map<pair<string,int>,int> mp;
	map<int,int> sn;
	int idx=1;
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		string tmp,word;
		string father;
		cin>>tmp;tmp+='/';
		int lv=1;
		for(auto z:tmp)
		{
			if(z=='/')
			{
				if(mp[{word,lv}]==0) mp[{word,lv}]=idx++;
				sn[mp[{word,lv}]]=0;
				if(father.empty())
				{
					rt[word]=1;
				}
				else
				{
					v[mp[{father,lv-1}]].pb(mp[{word,lv}]);
				}
				father=word;
				word="";
				lv++;
			}
			else word+=z;
		}
	}
	for(int i=1;i<=m;i++)
	{
		string tmp,word;
		string father;
		cin>>tmp;tmp+='/';
		int lv=1;
		for(auto z:tmp)
		{
			if(z=='/')
			{
				if(mp[{word,lv}]==0) mp[{word,lv}]=idx++;
				sn[mp[{word,lv}]]=1;
				if(father.empty())
				{
					rt[word]=1;
				}
				else
				{
					v[mp[{father,lv-1}]].pb(mp[{word,lv}]);
				}
				father=word;
				word="";
				lv++;
			}
			else word+=z;
		}
	}
	int ans=0;
	for(auto z:rt)
	{
		//cout<<bfs(mp[z.fi])<<' ';
		queue<int> q;
		q.push(mp[{z.fi,1}]);
		while(q.size())
		{
			int cur=q.front();
			q.pop();
			if(sn[cur]==0) ans++;
			else
			{
				for(auto z:v[cur])
				{
					q.push(z);
				}
			}
		}
	}
	cout<<ans<<endl;
}

int main()
{
	int T=1;
	cin>>T;
	while(T--) solve();
}