#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int tc;
  cin >> tc;
  while (tc--) {
    int n, m;
    cin >> n >> m;

    map<string, int> idx;
    vector edge(0, tuple(0, 0, 0));

    auto addEdge = [&](string& s, int tag) {
      for (int j = 0, prev = 0; j < s.size(); j++) {
        int e = find(s.begin() + j, s.end(), '/') - s.begin();
        string t = string(s.begin(), s.begin() + e);
        if (idx.contains(t)) {
          prev = idx[t];
          continue;
        } else {
          idx[t] = idx.size() + 1;
          edge.emplace_back(prev, idx[t], tag);
          j = e;
          prev = idx[t];
        }
      }
    };

    for (int i = 0; i < n; i++) {
      string s;
      cin >> s;
      addEdge(s, 1);
    }
    for (int i = 0; i < m; i++) {
      string s;
      cin >> s;
      addEdge(s, 0);
    }

    vector adj(idx.size() + 1, vector(0, pair(0, 0)));
    for (auto& [u, v, tag] : edge) {
      adj[u].emplace_back(v, tag);
    }

    int ans = 0;
    vector dp(n, 1);
    auto dfs = [&](auto&& self, int u) -> void {
      for (auto& [v, tag] : adj[u]) {
        self(self, v);
        if (adj[v].size() == 0) {
          dp[v] = tag;
        }
        dp[u] &= dp[v] == true;
      }
      if (dp[u] == false or u == 0) {
        for (auto& [v, tag] : adj[u]) {
          ans += dp[v];
        }
      }
    };
    dfs(dfs, 0);

    cout << ans << '\n';
  }

  return 0;
}