# 【TLE想定】各頂点の A隣接数 ca[], C隣接数 cc[] を持ち、クエリごとに v の隣接を全部なめる # 正しいが O(Σ deg(v_i))。スター中心へのクエリを繰り返すと 2e4 * 5e5 = 1e10 で TLE import sys def main(): d=sys.stdin.buffer.read().split();n,m=int(d[0]),int(d[1]);s=list(d[2].decode());p=3 adj=[[] for _ in range(n)] for _ in range(m): u,v=int(d[p])-1,int(d[p+1])-1;p+=2;adj[u].append(v);adj[v].append(u) ca=[0]*n;cc=[0]*n for v in range(n): if s[v]=='A': for u in adj[v]: ca[u]+=1 elif s[v]=='C': for u in adj[v]: cc[u]+=1 ans=sum(ca[b]*cc[b] for b in range(n) if s[b]=='W') q=int(d[p]);p+=1;out=[] for _ in range(q): v=int(d[p])-1;x=d[p+1].decode();p+=2;o=s[v] if o!=x: if o=='W': ans-=ca[v]*cc[v] elif o=='A': for u in adj[v]: if s[u]=='W': ans-=cc[u] ca[u]-=1 elif o=='C': for u in adj[v]: if s[u]=='W': ans-=ca[u] cc[u]-=1 s[v]=x if x=='W': ans+=ca[v]*cc[v] elif x=='A': for u in adj[v]: if s[u]=='W': ans+=cc[u] ca[u]+=1 elif x=='C': for u in adj[v]: if s[u]=='W': ans+=ca[u] cc[u]+=1 out.append(ans) print(*out,sep='\n') main()