#pragma GCC optimize(2)

 #include<queue>

 #include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 using namespace std;

 const int N = 5e5+1e4;

 const int M = 1e6+;

 queue < int > Q ;

 typedef struct Aho_Corasick_Automaton{

     int Son[N][],End[N],Fail[N],idx;

     void Init(){

         idx =  ;

         while( !Q.empty() ) Q.pop() ;

         memset(Son ,  , sizeof Son );

         memset(End ,  , sizeof End );

         memset(Fail,  , sizeof Fail );

     }

     void Insert(char s[]){

         int p =  ;

         for(int i=;s[i];i++){

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

             if( !Son[p][t] )

                 Son[p][t] = ++idx;

             p = Son[p][t] ;

         }

         End[p] ++ ;

     }

     void Build(){

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

             if( Son[][i] )

                 Fail[Son[][i]] =  ,Q.push(Son[][i]);

         }

         while( !Q.empty() ){

             int u = Q.front() ;

             Q.pop();

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

                 if( Son[u][i] ){

                     Fail[Son[u][i]] = Son[Fail[u]][i] ;

                     Q.push( Son[u][i] );

                 }else{

                     Son[u][i] = Son[Fail[u]][i];

                 }

             }

         }

     }

     void Query(char s[]){

         int p = ,res = ;

         for(int i=;s[i];i++){

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

             p = Son[p][t] ;

             for(int j=p ; j && ~End[j] ; j = Fail[j] ){

                 res += End[j] ;

                 End[j] = - ;

             }

         }

         //printf("%d\n",res);

         cout << res << endl ;

     }

 }AC_Machine ;

 AC_Machine AC ;

 char s[M];

 int n;

 int main(){

     ios_base :: sync_with_stdio(false);

     cin.tie(NULL) , cout.tie(NULL);

     int T;

     cin >> T ;

     while(T--){

         cin >> n ;

         AC.Init();

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

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

             cin >> s ;

             AC.Insert(s);

         }

         AC.Build();

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

         cin >> s ;

         AC.Query(s);

     }

     return ;

 }