#include<bits/stdc++.h>
using namespace std;

template<typename T>
void read(T &a){
    #define gc getchar()
    char c;a=0;int f=1;
    while(!isdigit(c=gc))if(c=='-')f=-1;
    do a=a*10+c-'0';
    while(isdigit(c=gc));
    a*=f;
}
template<typename T>
void write(T a){
    if(a<0)putchar('-'),a=-a;
    if(a>=10)write(a/10);
    putchar('0'+a%10);
}
/*
这里不能拆点，然后类似2-sat做，是因为反向的限制无法刻画，没有逆否命题
*/
int n,d,m;
char s[50010];
struct Q{
    int i,j;
    char hi,hj;
}a[100010];
int h[100010];
struct Edge{
    int ne,to;
}e[200010];int eid;
void add_edge(int x,int y){
    e[eid].ne=h[x];e[eid].to=y;h[x]=eid++;
}
int id[][3]={{-1,0,1},{0,-1,1},{0,1,-1}};
int choose[][2]={{1,2},{0,2},{0,1}};
int dfn[100010],low[100010],stk[100010],num[100010],scc_num,tp,dfc;
bool ins[100010];
void tarjan(int x){
    low[x]=dfn[x]=++dfc;
    stk[++tp]=x;ins[x]=1;
    for(int i=h[x];~i;i=e[i].ne){
        int y=e[i].to;
        if(!dfn[y]){
            tarjan(y);
            low[x]=min(low[x],low[y]);
        }else if(ins[y])low[x]=min(low[x],dfn[y]);
    }
    if(low[x]==dfn[x]){
        ++scc_num;
        do{
            ins[stk[tp]]=0;
            num[stk[tp]]=scc_num;
        }while(stk[tp--]!=x);
    }
}
int ans[50010];
bool solve(){
    eid=0;for(int i=1;i<=n*2;++i)h[i]=-1;eid=0;
    for(int i=1;i<=m;++i){
        int x=a[i].i,y=a[i].j;
        char cx=a[i].hi,cy=a[i].hj;
        int i1=id[s[x]-'a'][cx-'A'];
        int i2=id[s[y]-'a'][cy-'A'];
        if(i1==-1)continue;
        if(i2==-1){
            add_edge(2*x-i1,2*x-(1-i1));
            continue;
        }
        add_edge(2*x-i1,2*y-i2);
        add_edge(2*y-(1-i2),2*x-(1-i1));
    }
    for(int i=1;i<=n*2;++i)dfn[i]=0;
    scc_num=dfc=0;
    for(int i=1;i<=n*2;++i)
        if(!dfn[i]){
            tp=0;
            tarjan(i);
        }
    for(int i=1;i<=n;++i){
        if(num[i*2-1]==num[i*2])return 0;
        ans[i]=choose[s[i]-'a'][num[i*2-1]<num[i*2]];
    }
    for(int i=1;i<=n;++i)putchar('A'+ans[i]);puts("");
    return 1;
}
vector<int> b;
signed main(){
    // freopen("P3825_18.in","r",stdin);
    // freopen(".out","w",stdout);
    cin>>n>>d;
    scanf("%s",s+1);
    for(int i=1;i<=n;++i)
        if(s[i]=='x')b.emplace_back(i);
    cin>>m;
    for(int i=1;i<=m;++i){
        cin>>a[i].i>>a[i].hi>>a[i].j>>a[i].hj;
    }
    for(int i=0;i<1<<d;++i){
        for(int j=0;j<d;++j)
            s[b[j]]=i>>j&1?'a':'b';
        if(solve())return 0;
    }
    puts("-1");
    return 0;
}