AHOCUR

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1024)
#define AL (130)
#define PT (MX)
bool o[PT];
int g[MX][AL],f[MX],E,q[MX];
vi O[MX];
void ini(){E=1;for(auto&h:O)h.clear();F(AL)g[0][i]=0;CL(f,0);}//MODIFY!! - no test for 2+
void add(char*s,int I){
    int L=strlen(s),u=0,c;
    F(L){
        if(!g[u][c=s[i]]){
            g[u][c]=E++;
            F(AL)g[E-1][i]=0;
        }
        u=g[u][c];
    }
    O[u].PB(I);
}
void bld(){
    int x,r,b=-1,e=0,u;
    F(AL)if(g[0][i])f[g[0][i]]=0,q[e++]=g[0][i];
    while(++b<e)F(AL){
        x=g[u=q[b]][i],r=g[f[u]][i];
        if(!x)g[u][i]=r;
        else{
            q[e++]=x,f[x]=r;
            for(auto&h:O[r])O[x].PB(h);
        }
    }
}
void fnd(char*T){
    int L=strlen(T),u=0,c;
    F(L){
        c=T[i];
        while(u&&!g[u][c])u=f[u];
        u=g[u][c];
        for(auto&h:O[u])o[h]=1;
    }
}
#define CAL(s) CL(o,0),fnd(s)
char s[MX];
double p[MX],dp[MX][128];
int N,C[MX][128],L;
double dyn(int u,int l){
    if(!O[u].empty())return 1;
    if(!~l)return 0;
    double&v=dp[u][l];
    if(C[u][l]++)return v;
    v=0;
    F(N)v+=dyn(g[u][(int)s[i]],l-1)*p[i];
    return v;
}
int main(void){
    IN(_)F(_){
        scanf("%d",&N),ini(),CL(C,0);
        F(N)scanf("%s",s),add(s,i);
        bld();
        scanf("%d",&N);
        F(N)scanf(" %c%lf",s+i,p+i);
        scanf("%d",&L);
        printf("Case #%d: %.6lf\n",i+1,1-dyn(0,L-1));
    }
    return 0;
}