#include <iostream>
#include <fstream>
#include <sstream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iomanip>
#include <cctype>
#include <cassert>
#include <bitset>
#include <ctime>

using namespace std;

#define pau system("pause")
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define clr(a, x) memset(a, x, sizeof(a))

const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;

int T, n, ans;
char s[10015], t[1000015];
struct trie {
    char c;
    int vis, is_end, index;
    int fail;
    trie *nex[26];
} *root;
trie *create_node(char c) {
    trie *T = new trie;
    T -> c = c;
    T -> vis = T -> is_end = T -> index = 0;
    T -> fail = 0;
    for (int i = 0; i < 26; ++i) {
        T -> nex[i] = NULL;
    }
    return T;
}
void Insert(int l) {
    trie *tT = root;
    for (int i = 1; i <= l; ++i) {
        int x = s[i] - ‘a‘;
        if (NULL == tT -> nex[x]) {
            tT -> nex[x] = create_node(s[i]);
        }
        tT = tT -> nex[x];
        if (i == l) {
            ++tT -> is_end;
        }
    }
}
trie *arr[261111];
int index;
void get_fail() {
    queue<int> que;
    que.push(1);
    arr[1] = root;
    while (que.size()) {
        int x = que.front(); que.pop();
        for (int i = 0; i < 26; ++i) {
            if (NULL == arr[x] -> nex[i]) continue;
            arr[++index] = arr[x] -> nex[i];
            arr[x] -> nex[i] -> index = index;
            int y = arr[x] -> fail;
            while (y && NULL == arr[y] -> nex[i]) {
                y = arr[y] -> fail;
            }
            if (!y) {
                arr[index] -> fail = 1;
            } else {
                arr[index] -> fail = arr[y] -> nex[i] -> index;
            }
            que.push(index);
        }
    }
}
void go() {
    trie *tT = root;
    for (int i = 1; t[i]; ++i) {
        int x = t[i] - ‘a‘;
        while (tT != root && NULL == tT -> nex[x]) {
            tT = arr[tT -> fail];
        }
        if (root != tT || tT -> nex[x]) {
            tT = tT -> nex[x];
        }
        tT -> vis = 1;
    }
    for (int i = 1; i <= index; ++i) {
        if (arr[i] -> vis) {
            int y = arr[i] -> fail;
            while (y && !arr[y] -> vis) {
                arr[y] -> vis = 1;
                y = arr[y] -> fail;
            }
        }
    }
    for (int i = 1; i <= index; ++i) {
        ans += arr[i] -> vis * arr[i] -> is_end;
    }
}
int main() {
    scanf("%d", &T);
    while (T--) {
        root = create_node(‘#‘);
        ans = 0, index = 1;
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i) {
            scanf("%s", s + 1);
            int l = strlen(s + 1);
            Insert(l);
        }
        get_fail();
        /*for (int i = 1; i <= index; ++i) {
            printf("arr[%d] c = %c, is_end = %d, fail = %d\n", i, arr[i] -> c, arr[i] -> is_end, arr[i] -> fail);
        }*/
        scanf("%s", t + 1);
        go();
        printf("%d\n", ans);
    }
    return 0;
}