#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
#define For(i,j,k) for (int i=(j);i<=(k);i++)
#define rof(i,j,k) for (int i=(j);i>=(k);i--)
#define ull unsigned long long
#define lowbit(x) ((x)&(-(x)))
#define PII pair<int,int>
#define int long long
#define endl "\n"
#define ls rt<<1
#define rs rt<<1|1
const int mod = 998244353;
const int N=2e6+7;
int n,m;

struct st{
    string u;
    string v;
    st(string _v):v(_v){}
};
map<string,vector<st> >e;
map<string,int>mp;
map<string,int>mp1;
map<string,int>cc;
map<int,string>a;
void add_s(string s1,string s2){
    if(!mp[s1+s2])
    e[s1].push_back((s2)),mp[s1+s2]=1;
}
int cnt;
int dfs(string beg){
    
    int sum=0;
    for(int j=0;j<e[beg].size();j++){
        if(!mp1[e[beg][j].v]){
            sum++;
            //cout<<e[beg][j].v<<endl;
            mp1[e[beg][j].v]=1;
            continue;
        }
        else{
            sum+=dfs(e[beg][j].v);
            
        }
    }
    return sum;
}
void solve(){
    int ans=0;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        string str;
        cin>>str;
        string s0;
        string s1;
        int fl=0;
        int len=str.length();
        str+='/';
        for(int j=0;j<=len;j++){
            if(str[j]!='/'){
                s0+=str[j];
            }
            else{
                if(fl==0){
                  
                    s1=s0;
                    if(!cc[s1])
                    a[cnt++]=s1,cc[s1]=1;
                    fl=1;
                }
                else{
                    add_s(s1,s0);
                    s1=s0;
                }
             
                s0.clear();
            }
        }
    }
    for(int i=1;i<=m;i++){
        string str;cin>>str;
        int len=str.length();
        str+='/';
        string s0;
        for(int j=0;j<=len;j++){
            if(str[j]!='/'){
                s0+=str[j];
            }
            else{
                if(!mp1[s0])
                mp1[s0]=1;
                s0.clear();
            }
        }
    }
  //  for(int i=0;i<cnt;i++)cout<<a[i]<<" "; 
    for(int i=0;i<cnt;i++){
        if(!mp1[a[i]]){
            ans++;
            mp1[a[i]]=1;
            //cout<<a[i]<<endl;
        }
        else{
            ans+=dfs(a[i]);
            //cout<<"!"<<a[i]<<endl;
        }
        
        
    }
    cout<<ans<<endl;
}

signed main(){
    fast;
    int t=1;
    cin>>t;
    while(t--){
        e.clear();
        mp.clear();
        mp1.clear();
        a.clear();
        cc.clear();
        cnt=0;
        solve();
    }
}