#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = uint64_t;
// #define int ll
#define endl '\n'
const int MAX = 5e5 + 5, mod = 1e9 + 7;

hash<string> hs;
struct TRIE{
    static const int M = 3e6 + 10, N = 65;
    int size = 0;
    vector<map<ull, int>> tree;
    vector<int> status;
    TRIE(){
        tree.resize(M);
        status.resize(M);
    }
    void clear(){
        for (int i = 0; i <= size; i ++){
            tree[i].clear();
            status[i] = 0;
        }
        size = 0;
    }
    void insert(const vector<ull> &a, int st){
        int cur = 0;
        for (int i = 0; i < a.size(); i ++){
            if (tree[cur].find(a[i]) == tree[cur].end()){
                tree[cur][a[i]] = ++size;
            }
            cur = tree[cur][a[i]];
            status[cur] |= st;
        }
    }
    int dfs(int cur){
        int ans = 0;
        if (status[cur] == 1) return 1;
        if (status[cur] == 2) return 0;
        for (auto [u, v] : tree[cur]){
            ans += dfs(v);
        }
        // cerr << cur << ' ' << ans << endl;
        return ans;
    }
};
TRIE trie;
void solve(){
    int n, m;
    cin >> n >> m;
    trie.clear();
    for (int i = 0; i < n; i ++){
        string s; cin >> s;
        string t;
        vector<ull> a;
        for (int i = 0; i < s.size(); i ++){
            if (s[i] == '/'){
                a.push_back(hs(t));
                t.clear();
            }
            else{
                t += s[i];
            }
        }
        a.push_back(hs(t));
        trie.insert(a, 1);
    }
    for (int i = 0; i < m; i ++){
        string s; cin >> s;
        string t;
        vector<ull> a;
        for (int i = 0; i < s.size(); i ++){
            if (s[i] == '/'){
                a.push_back(hs(t));
                t.clear();
            }
            else{
                t += s[i];
            }
        }
        a.push_back(hs(t));
        trie.insert(a, 2);
    }
    cout << trie.dfs(0) << endl;
    // cerr << endl;
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T=1;cin>>T;while(T--)
    solve();
}