#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


struct Scc {
  int n;
  vector<int> as, bs;
  vector<int> ptr, zu, us;

  int l;
  vector<int> ids;
  int operator[](int u) const { return ids[u]; }

  explicit Scc(int n_) : n(n_), as(), bs(), l(-1) {}
  void ae(int u, int v) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    as.push_back(u);
    bs.push_back(v);
  }

  void dfs0(int u) {
    if (!ids[u]) {
      ids[u] = -1;
      for (int i = ptr[u]; i < ptr[u + 1]; ++i) dfs0(zu[i]);
      us.push_back(u);
    }
  }
  void dfs1(int u) {
    if (!~ids[u]) {
      ids[u] = l;
      for (int i = ptr[u]; i < ptr[u + 1]; ++i) dfs1(zu[i]);
    }
  }
  void run() {
    const int m = as.size();
    ptr.resize(n + 2);
    zu.resize(m);
    for (int u = 0; u < n + 2; ++u) ptr[u] = 0;
    for (int i = 0; i < m; ++i) ++ptr[as[i] + 2];
    for (int u = 2; u < n + 1; ++u) ptr[u + 1] += ptr[u];
    for (int i = 0; i < m; ++i) zu[ptr[as[i] + 1]++] = bs[i];
    ids.assign(n, 0);
    us.clear();
    for (int u = 0; u < n; ++u) dfs0(u);
    for (int u = 0; u < n + 2; ++u) ptr[u] = 0;
    for (int i = 0; i < m; ++i) ++ptr[bs[i] + 2];
    for (int u = 2; u < n + 1; ++u) ptr[u + 1] += ptr[u];
    for (int i = 0; i < m; ++i) zu[ptr[bs[i] + 1]++] = as[i];
    l = 0;
    for (int j = n; --j >= 0; ) if (!~ids[us[j]]) { dfs1(us[j]); ++l; }
  }

  vector<vector<int>> group() const {
    assert(~l);
    vector<vector<int>> uss(l);
    for (int u = 0; u < n; ++u) uss[ids[u]].push_back(u);
    return uss;
  }
};


int N;
char S[100'010];
int M;
vector<int> U, V;
vector<char> P, Q;

int main() {
  for (; ~scanf("%d%*d", &N); ) {
    scanf("%s", S);
    scanf("%d", &M);
    U.resize(M);
    V.resize(M);
    P.resize(M);
    Q.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d %c%d %c", &U[i], &P[i], &V[i], &Q[i]);
      --U[i];
      --V[i];
    }
    
    vector<int> xs;
    for (int u = 0; u < N; ++u) if (S[u] == 'x') {
      xs.push_back(u);
    }
    const int xsLen = xs.size();
    
    string ans = "-1";
    for (int f = 0; f < 1 << xsLen; ++f) {
      string s = S;
      for (int j = 0; j < xsLen; ++j) {
        s[xs[j]] = "aA"[f >> j & 1];
      }
// cerr<<"s = "<<s<<endl;
      // -1: true, -2: false
      auto calc = [&](int u, char p) -> int {
        if (s[u] == 'A') {
          return (p == 'A') ? -1 : -2;
        } else {
          int d = (p - 'A') - (s[u] - 'a');
          if (d < 0) d += 3;
          return (d == 0) ? -2 : (d == 1) ? (u << 1) : (u << 1 | 1);
        }
      };
      bool ok = true;
      Scc scc(N << 1);
      for (int i = 0; i < M; ++i) {
        const int z = calc(U[i], P[i]);
        const int w = calc(V[i], Q[i]);
        if (z == -1) {
          if (w == -2) {
            ok = false;
            break;
          } else if (w >= 0) {
            // w
            scc.ae(w ^ 1, w);
          }
        } else if (z >= 0) {
          if (w == -2) {
            // not z
            scc.ae(z, z ^ 1);
          } else if (w >= 0) {
            // z ==> w
            scc.ae(z, w);
            scc.ae(w ^ 1, z ^ 1);
          }
        }
      }
      if (ok) {
        scc.run();
        for (int u = 0; u < N; ++u) {
          ok = ok && (scc[u << 1] != scc[u << 1 | 1]);
        }
        if (ok) {
          ans = s;
          for (int u = 0; u < N; ++u) if (s[u] != 'A') {
            ans[u] = 'A' + ((s[u] - 'a') + ((scc[u << 1] < scc[u << 1 | 1]) ? 2 : 1)) % 3;
          }
          // judge
          for (int u = 0; u < N; ++u) {
            assert('A' <= ans[u]); assert(ans[u] <= 'C');
            assert(ans[u] != toupper(S[u]));
          }
          for (int i = 0; i < M; ++i) {
            if (ans[U[i]] == P[i]) {
              assert(ans[V[i]] == Q[i]);
            }
          }
          break;
        }
      }
    }
    puts(ans.c_str());
  }
  return 0;
}