#include<iostream>

#include<cmath>

#include<cstring>

#include<queue>

#include<vector>

#include<cstdio>

#include<algorithm>

#include<map>

#include<set>

#define rep(i,e) for(int i=0;i<(e);i++)

#define rep1(i,e) for(int i=1;i<=(e);i++)

#define repx(i,x,e) for(int i=(x);i<=(e);i++)

#define X first

#define Y second

#define PB push_back

#define MP make_pair

#define mset(var,val) memset(var,val,sizeof(var))

#define scd(a) scanf("%d",&a)

#define scdd(a,b) scanf("%d%d",&a,&b)

#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)

#define pd(a) printf("%d\n",a)

#define scl(a) scanf("%lld",&a)

#define scll(a,b) scanf("%lld%lld",&a,&b)

#define sclll(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)

#define IOS ios::sync_with_stdio(false);cin.tie(0)

#define lc idx<<1

#define rc idx<<1|1

#define lson l,mid,lc

#define rson mid+1,r,rc

using namespace std;

typedef long long ll;

template <class T>

void test(T a){cout<<a<<endl;}

template <class T,class T2>

void test(T a,T2 b){cout<<a<<" "<<b<<endl;}

template <class T,class T2,class T3>

void test(T a,T2 b,T3 c){cout<<a<<" "<<b<<" "<<c<<endl;}

const int N = 1e6+;

const int inf = 0x3f3f3f3f;

const ll INF = 0x3f3f3f3f3f3f3f3fll;

const ll mod = ;

int T;

void testcase(){

    printf("Case #%d:\n",++T);

}

const int MAXN = 1e5+;

const int MAXM = ;

const int p = ;

struct node{

    int l,r;

    ll hass;

}tree[MAXN<<];

char str[];

ll P[MAXN];

map<ll,int> ma;

int n;

void init(){

    P[]=;

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

        P[i]=p*P[i-];

    }

}

void Hash(char s[]){

    int len = strlen(s);

    ll res=;

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

        res +=P[len--i]*(s[i]-'a'+);

    }

    ma[res]=;

}

void push_up(int m,int idx){

    tree[idx].hass=tree[lc].hass*P[m]+tree[rc].hass;

}

void build(int l,int r,int idx){

    tree[idx].l=l,tree[idx].r=r;

    if(l==r){

        tree[idx].hass=str[l]-'a'+;

        return;

    }

    int mid = (l+r)>>;

    build(lson);

    build(rson);

    push_up(r-mid,idx);

}

void update(int pos,int idx){

    if(tree[idx].l==tree[idx].r){

        tree[idx].hass=str[pos]-'a'+;

        return;

    }

    int mid = (tree[idx].l+tree[idx].r)>>;

    if(pos<=mid) update(pos,lc);

    else update(pos,rc);

    push_up(tree[idx].r-mid,idx);

}

ll query(int l,int r,int idx){

    if(tree[idx].l>=l&&tree[idx].r<=r)

        return tree[idx].hass;

    int mid = (tree[idx].l+tree[idx].r)>>;

    if(r<=mid) return query(l,r,lc);

    else if(l>mid) return query(l,r,rc);

    return query(l,mid,lc)*P[r-mid]+query(mid+,r,rc);

}

int main() {

#ifdef LOCAL

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

#endif // LOCAL

    int t,m;

    scd(t);

    init();

    T=;

    char s1[],s2[];

    while(t--){

        testcase();

        ma.clear();

        scd(n);

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

            scanf("%s",str);

            Hash(str);

        }

        scanf("%s",str);

        int len = strlen(str);

        build(,len-,);

        scd(m);

        while(m--){

            scanf("%s",s1);

            if(s1[]=='Q'){

                int l,r;

                scdd(l,r);

                if(ma.find(query(l,r,))!=ma.end()) puts("Yes");

                else puts("No");

            }else{

                int pos;

                scanf("%d%s",&pos,s2);

                str[pos]=s2[];

                update(pos,);

            }

        }

    }

    return ;

}