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

typedef long long lint;
typedef long double louble;
template<typename T1,typename T2> inline T1 min(T1 a,T2 b){return a<b?a:b;}
template<typename T1,typename T2> inline T1 max(T1 a,T2 b){return b<a?a:b;}

namespace ae86
{
	const int bufl = 1<<15;

	char buf[bufl],*s=buf,*t=buf;

	inline int fetch()
	{
		if(s==t){t=(s=buf)+fread(buf,1,bufl,stdin);if(s==t)return EOF;}
		return *s++;
	}

	inline int ty()
	{
		int a=0,b=1,c=fetch();
		while(!isdigit(c))b^=c=='-',c=fetch();
		while(isdigit(c))a=a*10+c-48,c=fetch();
		return b?a:-a;
	}

	inline int tc()
	{
		int c=fetch();
		while(c<=32 && c!=EOF)c=fetch();
		return c;
	}

	template<typename T> inline int ts(T s[])
	{
		int a=0,c=fetch();
		while(c<=32 && c!=EOF)c=fetch();
		while(c>32 && c!=EOF)s[a++]=c,c=fetch();
		return a;
	}
}
using ae86::ty;
using ae86::tc;
using ae86::ts;

const int _ = 100007 , X = 9 , M = 200007 , N = 200007 , E = 1333333;

int to[E],ne[E],he[N]={0},ecnt=1;
void adde(int a,int b){to[++ecnt]=b,ne[ecnt]=he[a],he[a]=ecnt;}

int n,nn,bel[N]={0},stk[N],top;

int m,xcnt,xloc[X],lims[M][4],temp[N];
char s[_];

inline int loca(int x,int c)
{
	if(s[x]-'a'==c)return 0;
	return x+x-(c==(s[x]=='a'?1:0));
}

inline int tran(int x){return (x&1)?(x+1):(x-1);}

int dfs(int x)
{
	int xx=(x+1)/2;
	stk[++top]=xx,bel[xx]=(x+1)&1;
	for(int i=he[x];i;i=ne[i])
	{
		int b=to[i],bb=(b+1)/2;
		if(bel[bb]<0){if(!dfs(b))return 0;}
		else if(bel[bb]!=((b+1)&1))return 0;
	}
	return 1;
}

void finder()
{
	ecnt=1;
	for(int i=1;i<=nn;i++)he[i]=0,bel[i]=-1;

	for(int i=1;i<=m;i++)
	{
		int a=lims[i][0],b=lims[i][2],tara=lims[i][1],tarb=lims[i][3];
		if(tara==s[a]-'a')continue;
		if(tarb==s[b]-'a'){adde(loca(a,tara),tran(loca(a,tara)));continue;}
		adde(loca(a,tara),loca(b,tarb));
		adde(tran(loca(b,tarb)),tran(loca(a,tara)));
	}
	
	for(int i=1;i<=n;i++)temp[i]=i;
	random_shuffle(temp+1,temp+n+1);
	for(int i=1;i<=n;i++)
	{
		int a=temp[i];
		if(bel[a]>=0)continue;
		top=0;
		if(dfs(a+a-1))continue;
		for(int j=1;j<=top;j++)bel[stk[j]]=-1;
		top=0;
		if(!dfs(a+a))return;
	}

	for(int i=1;i<=n;i++)
	{
		if(s[i]=='a')putchar('B'+bel[i]);
		if(s[i]=='b')putchar('A'+bel[i]+bel[i]);
		if(s[i]=='c')putchar('A'+bel[i]);
	}
	puts("");
	
	exit(0);
}

#define pick(a,b) (((a)>>(b))&1)

int states[261]={0},statecnt=0;

int main()
{
	srand(time(0));
	n=ty(),xcnt=ty(),ts(s+1),m=ty(),nn=n+n;
	for(int i=1;i<=m;i++)
		lims[i][0]=ty(),lims[i][1]=tc()-'A',lims[i][2]=ty(),lims[i][3]=tc()-'A';
	for(int i=1,a=0;i<=n;i++)if(s[i]=='x')xloc[++a]=i;

	for(int i=0;i<(1<<xcnt);i++)states[statecnt++]=i;
	random_shuffle(states,states+statecnt);
	
	for(int i=0;i<statecnt;i++)
	{
		for(int j=1;j<=xcnt;j++)s[xloc[j]]='a'+pick(states[i],j-1);
		finder();
	}
	puts("-1");
	
	return 0;
}