#include <iostream>
#include <vector>
#include <map>

int n, m;
std::vector<std::string> s[107], t[107];
std::map<int, int> to[1000007];
int nodecnt, val[1000007];
int newNode() {
  ++nodecnt;
  val[nodecnt] = 0;
  std::map<int, int>().swap(to[nodecnt]);
  return nodecnt;
}
void insert(std::vector<std::string> s, int dd) {
  int p = 1;
  val[p] += dd;
  for (auto i : s) {
    int r = std::hash<std::string>()(i);
    if (to[p].find(r) == to[p].end()) {
      to[p][r] = newNode();
    }
    p = to[p][r];
    val[p] += dd;
  }
}
int dfs(int u) {
  int ans = 0;
  for (auto [r, v] : to[u]) {
    if (val[v] == 0) {
      ++ans;
    } else {
      ans += dfs(v);
    }
  }
  return ans;
}

void solve() {
  nodecnt = 0, newNode();
  std::cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    s[i].clear();
    std::string p, q;
    std::cin >> p, p += '/';
    for (char j : p) {
      if (j == '/') {
        s[i].push_back(q), q = "";
      } else {
        q += j;
      }
    }
    insert(s[i], 0);
  }
  for (int i = 1; i <= m; ++i) {
    t[i].clear();
    std::string p, q;
    std::cin >> p, p += '/';
    for (char j : p) {
      if (j == '/') {
        t[i].push_back(q), q = "";
      } else {
        q += j;
      }
    }
    insert(t[i], 1);
  }
  std::cout << dfs(1) << '\n';
}

int main() {
  std::cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  std::cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}