# 【TLE想定】クエリごとに全体を再計算 O(Q(N+M)) = 2e4 * 1e6 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 U=[0]*m;V=[0]*m for i in range(m): U[i],V[i]=int(d[p])-1,int(d[p+1])-1;p+=2 q=int(d[p]);p+=1;out=[] for _ in range(q): v=int(d[p])-1;x=d[p+1].decode();p+=2;s[v]=x ca=[0]*n;cc=[0]*n for i in range(m): a,b=U[i],V[i] if s[a]=='A': ca[b]+=1 elif s[a]=='C': cc[b]+=1 if s[b]=='A': ca[a]+=1 elif s[b]=='C': cc[a]+=1 out.append(sum(ca[i]*cc[i] for i in range(n) if s[i]=='W')) print(*out,sep='\n') main()