#include <bits/stdc++.h>

constexpr int MAXS = 1e5 + 19;

std::map<std::string, int> next[MAXS];
std::array<int, 2> size[MAXS];
int tot;
int new_node() {
    ++tot;
    next[tot].clear();
    size[tot].fill(0);
    return tot;
}

std::string get_front(std::string_view &s) {
    std::string res;
    while (!s.empty() && isalpha(s[0])) {
        res += s[0];
        s = s.substr(1);
    }
    return res;
}
void insert(int node, std::string_view s, int tp) {
    size[node][tp] += 1;
    while (!s.empty()) {
        std::string res = get_front(s);
        if (!s.empty()) {
            s = s.substr(1);
        }
        int &to = next[node][res];
        if (!to) {
            to = new_node();
        }
        node = to;
        size[node][tp] += 1;
    }
}

void solve() {
    int n, m;
    std::cin >> n >> m;

    tot = 0;
    int rt = new_node();

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

    auto dfs = [&](auto self, int node) -> int {
        if (next[node].empty()) {
            return size[node][0];
        }
        int res = 0;
        for (auto [str, to] : next[node]) {
            res += self(self, to);
        }
        if (node != rt && size[node][1] == 0) {
            res = std::min(res, 1);
        }
        return res;
    };

    std::cout << dfs(dfs, 1) << '\n';
}

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

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }
}