#include<iostream>

#include<cmath>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long ll;

const int maxn=*+;

struct node{

    int son[],f,v,cnt;

    void rnw(){memset(son,,sizeof(son));f=v=cnt=;}

}ch[maxn];

char s[],t[];

int tot,q[maxn],head,tail,T,n;

void add(char s[]){

    int u=,len;

    len=strlen(s);

    for(int i=;i<len;++i){

        int c=s[i]-'a';

        if(!ch[u].son[c]){ch[u].son[c]=++tot;}

        u=ch[u].son[c];

    }

    ch[u].cnt++;

}

void pre(){

    head=tail=;

    ch[].f=;

    for(int i=;i<;++i){

        int u=ch[].son[i];

        if(u){

            ch[u].f=;

            q[++tail]=u;

        }

    }

    while(head<tail){

        int now=q[++head];

        for(int i=;i<;++i){

            int u=ch[now].son[i];

            if(!u){

                ch[now].son[i]=ch[ch[now].f].son[i];

                continue;

            }

            q[++tail]=u;

            int v=ch[now].f;

            while(v&&!ch[v].son[i])v=ch[v].f;

            ch[u].f=ch[v].son[i];

        }

    }

}

ll solve(char t[]){

    ll res=;

    int len,u=;

    len=strlen(t);

    for(int i=;i<len;++i){

        int c=t[i]-'a';

        u=ch[u].son[c];

        //if(ch[u].cnt){

            int tmp=u;

            while(tmp){

                if(ch[tmp].cnt>=){

                    res+=ch[tmp].cnt;

                    ch[tmp].cnt=-;

                }

                else{break;}

                tmp=ch[tmp].f;

            }

        //}

    }

    return res;

}

int main(){

    cin>>T;

    while(T--){

        tot=;

        for(int i=;i<=;++i)ch[i].rnw();

        scanf("%d",&n);

        for(int i=;i<=n;++i){

            scanf("%s",s);add(s);

        }

        scanf("%s",t);

        pre();

        printf("%lld\n",solve(t));

    }

    system("pause");

    return ;

}

/*

1

2

abcdefgh

efg

abcdefgh

*/