#include <cstdio>

 #include <cstring>

 #include <queue>

 using namespace std;

 const int maxnode = ;

 const int sigma_size = ;

 int idx[];

 struct AhoCorasickAutomata

 {

     int ch[maxnode][sigma_size];

     int match[maxnode];

     int f[maxnode];

     int sz;

     void init() { sz = ; memset(ch[], , sizeof(ch[])); }

     void insert(char* s)

     {

         int u = , n = strlen(s);

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

         {

             int c = idx[s[i]];

             if(!ch[u][c])

             {

                 memset(ch[sz], , sizeof(ch[sz]));

                 match[sz] = ;

                 ch[u][c] = sz++;

             }

             u = ch[u][c];

         }

         match[u] = ;

     }

     void getFail()

     {

         queue<int> q;

         f[] = ;

         for(int c = ; c < sigma_size; c++)

         {

             int u = ch[][c];

             if(u) { f[u] = ; q.push(u); }

         }

         while(!q.empty())

         {

             int r = q.front(); q.pop();

             for(int c = ; c < sigma_size; c++)

             {

                 int u = ch[r][c];

                 if(!u) { ch[r][c] = ch[f[r]][c]; continue; }

                 q.push(u);

                 int v = f[r];

                 while(v && !ch[v][c]) v = f[v];

                 f[u] = ch[v][c];

                 match[u] |= match[f[u]];

             }

         }

     }

 }ac;

 int n;

 const int maxl =  + ;

 char s[][];

 double prob[sigma_size];

 int vis[maxnode][maxl];

 double d[maxnode][maxl];

 double getProb(int u, int L)

 {

     if(L == ) return 1.0;

     if(vis[u][L]) return d[u][L];

     vis[u][L] = ;

     double& ans = d[u][L];

     ans = ;

     for(int c = ; c < n; c++)

         if(!ac.match[ac.ch[u][c]])

             ans += prob[c] * getProb(ac.ch[u][c], L-);

     return ans;

 }

 int main()

 {

     //freopen("in.txt", "r", stdin);

     int T;

     scanf("%d", &T);

     for(int kase = ; kase <= T; kase++)

     {

         int k, L;

         scanf("%d", &k);

         for(int i = ; i < k; i++) scanf("%s", s[i]);

         scanf("%d", &n);

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

         {

             char s1[];

             scanf("%s%lf", s1, &prob[i]);

             idx[s1[]] = i;

         }

         ac.init();

         for(int i = ; i < k; i++) ac.insert(s[i]);

         ac.getFail();

         scanf("%d", &L);

         memset(vis, , sizeof(vis));

         printf("Case #%d: %.6f\n", kase, getProb(, L));

     }

     return ;

 }