#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int MAX = 205;
#define ff first
#define ss second

struct Node {
	map<string, Node> folders;
	vector<pair<string, bool>> files;
} root;

int res = 0;
bool dfs(Node *root) {
	bool ignore = root != &::root;
	int cnt_ignore_folders = 0;
	for (auto it = root->folders.begin(); it != root->folders.end(); ++it) {
		if (dfs(&it->second)) {
			cnt_ignore_folders++;
		} else {
			ignore = false;
		}
	}
	int cnt_ignore_files = 0;
	for (const auto &p : root->files) {
		if (p.ss) {
			cnt_ignore_files++;
		} else {
			ignore = false;
		}
	}
	if (!ignore) {
		res += cnt_ignore_folders + cnt_ignore_files;
	}
	return ignore;
}

void sol() {
	int n, m;
	cin >> n >> m;
	string s;
	root = {};
	for (int i = 0; i < n; i++) {
		Node *ptr = &root;
		cin >> s;
		string buf;
		for (char c : s) {
			if (c == '/') {
				ptr = &ptr->folders[buf];
				buf = "";
			} else {
				buf += c;
			}
		}
		ptr->files.push_back({buf, true});
	}
	for (int i = 0; i < m; i++) {
		Node *ptr = &root;
		cin >> s;
		string buf;
		for (char c : s) {
			if (c == '/') {
				ptr = &ptr->folders[buf];
				buf = "";
			} else {
				buf += c;
			}
		}
		ptr->files.push_back({buf, false});
	}
	
	res = 0;
	dfs(&root);
	cout << res << endl;
}

#undef int
int main() {
	IOS
	int tt=1;
	cin>>tt;
	while (tt--)
		sol();
	return 0;
}