#include using namespace std; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) using i64 = int64_t; using i128 = __int128_t; using ll = long long; using ul = unsigned long long; using ull = unsigned long long; using ld = long double; using vi = vector; using vll = vector; using vull = vector; using vc = vector; using vst = vector; using vd = vector; using vld = vector; using P = pair; template long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); } template auto min(const T &a){ return *min_element(a.begin(), a.end()); } template auto max(const T &a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; } template inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; } template istream &operator>>(istream &is, pair &p){ is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const pair &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template istream &operator>>(istream &is, vector &v){ for(T &in : v) is >> in; return is; } template ostream &operator<<(ostream &os, const vector &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template ostream &operator<<(ostream &os, const map &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template ostream &operator<<(ostream &os, const set &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, const multiset &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, queue q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template ostream &operator<<(ostream &os, deque q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template ostream &operator<<(ostream &os, stack st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template ostream &operator<<(ostream &os, priority_queue pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template void inGraph(vector> &G, U n, U m, bool directed = true, bool zero_index = true){ G.resize(n); for(int i = 0; i < m; i++){ int a, b; cin >> a >> b; if(!zero_index) a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } template long long binary_search(long long ok, long long ng, T check){ while(abs(ok - ng) > 1){ long long mid = (ok + ng) / 2; if(check(mid)) ok = mid; else ng = mid; } return ok; } template long double binary_search_real(long double ok, long double ng, T check, int iter = 100){ for(int i = 0; i < iter; ++i){ long double mid = (ok + ng) / 2; if(check(mid)) ok = mid; else ng = mid; } return ok; } long long trisum(long long a, long long b){ if(a > b) return 0; long long res = ((b - a + 1) * (a + b)) / 2; return res; } template T intpow(T x, int n){ T ret = 1; while(n > 0) { if(n & 1) (ret *= x); (x *= x); n >>= 1; } return ret; } template T getDivision(T a, T b){ if(b == 0) return -1; if(a >= 0 && b > 0){ return a / b; } else if(a < 0 && b > 0){ return a / b - (a % b != 0); } else if(a >= 0 && b < 0){ return a / b; } else{ return a / b + (a % b != 0); } } template T getReminder(T a, T b){ if(b == 0) return -1; if(a >= 0 && b > 0){ return a % b; } else if(a < 0 && b > 0){ return ((a % b) + b) % b; } else if(a >= 0 && b < 0){ return a % b; } else{ return (abs(b) - abs(a % b)) % b; } } template inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template void out(const T &a, const Ts&... b){ cout << a; ((cout << ' ' << b), ...); cout << '\n'; } void fout(){ cout << endl; } template void fout(const T &a, const Ts&... b){ cout << a; ((cout << ' ' << b), ...); cout << endl; } void debug(){ cerr << '\n'; } template void debug(const T &a, const Ts&... b){ cerr << a; ((cout << ' ' << b), ...); cerr << '\n'; } ll T; void input(){ in(T); } void solve(){ ll n, m; in(n, m); string s; in(s); vector G(n); rep(i, m){ ll u, v; in(u, v); u--, v--; G[u].push_back(v); G[v].push_back(u); } vll larges; vll is_large(n, -1); rep(i, n){ if((ll) G[i].size() >= 120){ is_large[i] = larges.size(); larges.push_back(i); } } ll len = larges.size(); vector G2(n); vll cnta(n), cntc(n); rep(i, n){ for(auto j : G[i]){ if(is_large[j] != -1) G2[i].push_back(j); } } vll kiyoa(n), kiyoc(n); vector kiyo(len, vll(len)); ll ans_small = 0; vll sa(n), sw(n), sc(n); auto add_small = [&](ll v, char c, ll cnt){ if(c == 'A'){ for(auto x : G[v]){ if(is_large[x] != -1){ cnta[x] += cnt; }else{ ll tmpc = 0; for(auto y : G[x]){ tmpc += sc[y]; if(is_large[y] != -1){ kiyoc[y] += cnt * sw[x]; } } ans_small += tmpc * cnt * sw[x]; } } sa[v] += cnt; }else if(c == 'C'){ for(auto x : G[v]){ if(is_large[x] != -1){ cntc[x] += cnt; }else{ ll tmpa = 0; for(auto y : G[x]){ tmpa += sa[y]; if(is_large[y] != -1){ kiyoa[y] += cnt * sw[x]; } } ans_small += tmpa * cnt * sw[x]; } } sc[v] += cnt; } if(c == 'W'){ ll tmpa = 0, tmpc = 0; for(auto x : G[v]){ tmpa += sa[x]; tmpc += sc[x]; } for(auto x : G[v]){ if(is_large[x] == -1) continue; kiyoa[x] += tmpc * cnt; kiyoc[x] += tmpa * cnt; for(auto y : G[v]){ if(is_large[y] == -1) continue; kiyo[is_large[x]][is_large[y]] += cnt; } } ans_small += tmpa * tmpc * cnt; sw[v] += cnt; } }; auto add_large = [&](ll v, char c, ll cnt){ ll id = is_large[v]; if(c == 'A'){ for(auto w : G2[v]) cnta[w] += cnt; ans_small += kiyoa[v] * cnt; sa[v] += cnt; rep(i, len){ kiyoc[larges[i]] += kiyo[id][i] * cnt; } }else if(c == 'C'){ for(auto w : G2[v]) cntc[w] += cnt; ans_small += kiyoc[v] * cnt; sc[v] += cnt; rep(i, len){ kiyoa[larges[i]] += kiyo[id][i] * cnt; } } if(c == 'W'){ sw[v] += cnt; } }; rep(i, n){ if(is_large[i] == -1){ add_small(i, s[i], 1); }else{ add_large(i, s[i], 1); } } ll q; in(q); while(q--){ ll v; in(v); v--; char x; in(x); if(is_large[v] == -1){ add_small(v, s[v], -1); s[v] = x; add_small(v, s[v], 1); }else{ add_large(v, s[v], -1); s[v] = x; add_large(v, s[v], 1); } ll ans_large = 0; for(auto w : larges){ ans_large += cnta[w] * cntc[w] * sw[w]; } out(ans_small + ans_large); } } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); T = 1; // input(); while(T--) solve(); }