#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define maxn 500005

struct TreeNodeType {

    int count;

    TreeNodeType *fail;

    TreeNodeType *next[];

    TreeNodeType()

    {

        fail=NULL,count=;

        for(int i=;i<;i++) next[i]=NULL;

    }

};

struct TreeNodeType *root,*que[maxn];

int n;

char str[maxn*],word[];

inline void in(int &now)

{

    char Cget=getchar();now=;

    while(Cget>''||Cget<'') Cget=getchar();

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

}

void insert(char *ch)

{

    int temp,len=strlen(ch);

    TreeNodeType *p=root;

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

    {

        temp=ch[i]-'a';

        if(p->next[temp]==NULL) p->next[temp]=new TreeNodeType;

        p=p->next[temp];

    }

    p->count++;

}

void build()

{

    int tail=,head=;que[head]=root;

    while(head<tail)

    {

        TreeNodeType *p=que[head++],*temp=NULL;

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

        {

            if(p->next[i]==NULL) continue;

            if(p==root) p->next[i]->fail=root;

            else

            {

                temp=p->fail;

                while(temp!=NULL)

                {

                    if(temp->next[i]!=NULL)

                    {

                        p->next[i]->fail=temp->next[i];

                        break;

                    }

                    temp=temp->fail;

                }

                if(temp==NULL) p->next[i]->fail=root;

            }

            que[tail++]=p->next[i];

        }

    }

}

int query()

{

    int pos,len=strlen(str),res=;TreeNodeType *p=root;

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

    {

        pos=str[i]-'a';

        while(p->next[pos]==NULL&&p!=root) p=p->fail;

        if(p->next[pos]!=NULL) p=p->next[pos];else p=root;

        TreeNodeType *temp=p;

        while(temp!=root&&temp->count!=-) res+=temp->count,temp->count=-,temp=temp->fail;

    }

    return res;

}

int main()

{

    int T;

    in(T);

    while(T--)

    {

        root=new TreeNodeType;

        in(n);for(int i=;i<=n;i++) gets(word),insert(word);

        build(),scanf("%s",str),printf("%d\n",query());

    }

    return ;

}