#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define S second
#define F first
int ans = 0;
unordered_map<string, set<string>> adj;
unordered_map<string, int> cnt;
int n, m;


void dfs(string v){
     for(auto u : adj[v]){
            dfs(u);
            cnt[v] += cnt[u];
     }
}

void answr(string v){
   if(cnt[v] == 0 && v != ""){
       ans++;
       return;
   }
   for(auto u : adj[v]) answr(u);
}


void solve(){
   adj.clear();
   cnt.clear();
   cin >> n >> m;
   string s;
   for(int i = 0; i < n + m; i++){
       cin >> s;
       int prev = 0;
       for(int j = 0; j < s.size(); j++){
               if(s[j] == '/') adj[s.substr(0, prev)].insert(s.substr(0, j)), prev = j;
       }
       adj[s.substr(0, prev)].insert(s);
       if(i < n) cnt[s] = 0;
       else cnt[s] = 1;
   }

   ans = 0;
   dfs("");
   answr("");


   cout << ans << '\n';

}
int main(){

    ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    int t;  cin >> t; while(t--) solve();

}