#include <bits/stdc++.h>

int main() {
    // freopen("in", "r", stdin);
    int ttt;
    std::cin >> ttt;
    while (ttt--) {
        int n, m;
        std::cin >> n >> m;
        std::vector<std::map<std::string, int>> ver;
        std::vector<bool> ign;
        ver.emplace_back(std::map<std::string, int>{});
        ign.emplace_back(true);
        int rt = 0;

        auto Insert = [&] (int &p, std::string &&t, bool k) -> void {
            if (ver[p].find(t) == ver[p].end()) {
                ver[p].insert({t, (int)ver.size()});
                ver.emplace_back(std::map<std::string, int>{});
                ign.emplace_back(k);
            }
            p = ver[p][t];
            t = "";
        };
        for (int i = 0; i < n; ++i) {
            std::string s, t;
            std::cin >> s;
            int p = rt;
            for (auto &c: s) {
                if (c == '/') {
                    Insert(p, std::move(t), true);
                    continue;
                }
                t += c;
            }
            Insert(p, std::move(t), true);
        }
        for (int i = 0; i < m; ++i) {
            std::string s, t;
            std::cin >> s;
            int p = rt;
            for (auto &c: s) {
                if (c == '/') {
                    Insert(p, std::move(t), false);
                    continue;
                }
                t += c;
            }
            Insert(p, std::move(t), false);
        }

        int ans = 0;
        auto dfs = [&] (auto dfs, const int u) -> bool {
            if (ver[u].empty()) {
                return ign[u];
            }
            bool ignored = true;
            int cnt = 0;
            for (auto &[_, v]: ver[u]) {
                auto child_ign = dfs(dfs, v);
                if (child_ign) {
                    ++cnt;
                }
                ignored = ignored && child_ign;
            }
            //printf("%d %d\n", u, cnt);
            if (!ignored) {
                ans += cnt;
            }
            return ignored;
        } ;
        for (auto &[_, u] : ver[rt]) {
            if (dfs(dfs, u)) {
                ++ans;
            }
        }
        std::cout << std::max(ans, 1) << '\n';
    }
    return 0;
}