// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXM = 100005;
const int MAXN = 50005;

int n, d;
string s;
int m;
tuple<int, char, int, char> rules[MAXM];
vi adj[MAXN * 4];

inline int getid(int a, char ha) {
    char ot = 'A' + 'B' + 'C' - ha - s[a];
    return ha > ot;
}

vi stk;
int instk[MAXN * 4], pre[MAXN * 4], low[MAXN * 4], comp[MAXN * 4], ptr, cc;
void scc(int u) {
    pre[u] = low[u] = ptr++;
    stk.pb(u);
    instk[u] = 1;
    for (int v : adj[u]) {
        if (!pre[v]) {
            scc(v);
            mnto(low[u], low[v]);
        } else if (instk[v]) {
            mnto(low[u], pre[v]);
        }
    }
    if (pre[u] == low[u]) {
        while (1) {
            int x = stk.back(); stk.pop_back(); instk[x] = 0;
            comp[x] = cc;
            if (x == u) {
                break;
            }
        }
        cc++;
    }
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> d;
    cin >> s;
    REP (i, 0, n) {
        s[i] -= 32;
    }
    cin >> m;
    REP (i, 0, m) {
        int a, b; char ha, hb; cin >> a >> ha >> b >> hb;
        a--; b--;
        rules[i] = {a, ha, b, hb};
    }
    vi vx;
    REP (i, 0, n) {
        if (s[i] == 'X') {
            vx.pb(i);
        }
    }
    assert(SZ(vx) == d);
    REP (msk, 0, 1 << d) {
        REP (i, 0, d) {
            s[vx[i]] = 'A' + (msk >> i & 1);
        }
        ptr = 1;
        cc = 1;
        REP (i, 0, n << 2) {
            adj[i].clear();
            pre[i] = low[i] = 0;
        }
        //cerr << msk << '\n';
        REP (i, 0, n) {
            //cerr << (i << 2 ^ 1) << " <-> " << (i << 2 ^ 2) << '\n';
            //cerr << (i << 2 ^ 3) << " <-> " << (i << 2) << '\n';
            adj[i << 2 ^ 1].pb(i << 2 ^ 2);
            adj[i << 2 ^ 2].pb(i << 2 ^ 1);
            adj[i << 2 ^ 3].pb(i << 2);
            adj[i << 2].pb(i << 2 ^ 3);
        }
        REP (i, 0, m) {
            auto [a, ha, b, hb] = rules[i];
            if (s[a] == ha) {
                continue;
            }
            //cerr << a << ' ' << ha << ' ' << b << ' ' << hb << '\n';
            int ai = (a << 2) + (getid(a, ha) << 1);
            if (s[b] == hb) {
                //cerr << ai << " -> " << (ai ^ 1) << '\n';
                adj[ai].pb(ai ^ 1);
                continue;
            }
            int bi = (b << 2) + (getid(b, hb) << 1);
            //cerr << ai << " -> " << bi << '\n';
            //cerr << (bi ^ 1) << " -> " << (ai ^ 1) << '\n';
            adj[ai].pb(bi);
            adj[bi ^ 1].pb(ai ^ 1);
        }
        REP (i, 0, n << 2) {
            if (pre[i]) {
                continue;
            }
            scc(i);
            assert(stk.empty());
        }
        bool pos = 1;
        REP (i, 0, n) {
            if (comp[i << 2] == comp[i << 2 ^ 1]) {
                pos = 0;
                break;
            }
            if (comp[i << 2 ^ 2] == comp[i << 2 ^ 3]) {
                pos = 0;
                break;
            }
        }
        if (!pos) {
            continue;
        }
        REP (i, 0, n << 2) {
            //cerr << i << ": " << comp[i] << '\n';
        }
        string ans = "";
        REP (i, 0, n) {
            if (comp[i << 2] < comp[i << 2 ^ 1]) {
                assert(comp[i << 2 ^ 2] > comp[i << 2 ^ 3]);
                REP (j, 'A', 'C' + 1) {
                    if (s[i] != j) {
                        ans += j;
                        break;
                    }
                }
            } else {
                assert(comp[i << 2 ^ 2] < comp[i << 2 ^ 3]);
                RREP (j, 'C', 'A') {
                    if (s[i] != j) {
                        ans += j;
                        break;
                    }
                }
            }
        }
        REP (i, 0, n) {
            assert(ans[i] != s[i]);
        }
        REP (i, 0, m) {
            auto [a, ha, b, hb] = rules[i];
            if (ans[a] == ha) {
                assert(ans[b] == hb);
            }
        }
        cout << ans << '\n';
        return 0;
    }
    cout << -1 << '\n';
    return 0;
}