#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define Acode ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define int long long
const int N = 1e5;
const int mod = 998244353;
const int inf = 1e10;

void solve()
{
    int n, m;
    cin >> n >> m;
    map<string, int> mp,mp1;
    string s1[n], s2[m];
    for (int i = 0; i < n;i++)
    {
        cin >> s1[i];
    }
    sort(s1, s1 + n);
    for (int i = 0; i < m;i++)
    {
        cin >> s2[i];
        string s = "";
        for (int j = 0; j < s2[i].size();j++)
        {
            if(s2[i][j]!='/')
            {
                s += s2[i][j];
            }
            else 
            {
                mp[s] = 1;
                s += s2[i][j];
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < n;i++)
    {
        string s = "";
        for (int j = 0; j < s1[i].size();j++)
        {
            if(s1[i][j]=='/')
            {
                if(!mp[s]&&!mp1[s])
                {
                    ans++;
                    mp1[s] = 1;
                    break;
                }
                if(mp1[s])
                {
                    break;
                }
            }
            s += s1[i][j];
            if(j==s1[i].size()-1)
                ans++;
        }
    }
    cout << ans << endl;
}
signed main()
{
    Acode;
    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}