#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=3e5+5,M=3e5+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,x[N];char s[N],c[N];vector<int> S[N];
ll ans,tot;
int Bg[N],En[N],Bh,fa[N];
void Make(int x){
	Bg[x]=++Bh;for(int i:S[x]) Make(i);En[x]=Bh;
}
struct bit{
	int f[N];
	void add(int x,int y){while(x<=n) f[x]+=y,x+=x&-x;}
	int qry(int x){int ans=0;while(x) ans+=f[x],x-=x&-x;return ans;}
}f1,f2;
void ins(int x){
	if(s[x]=='A'){
		tot+=f2.qry(En[x])-f2.qry(Bg[x]-1);
		f1.add(Bg[x],1);f1.add(En[x]+1,-1);
	} 
	else{
		tot+=f1.qry(Bg[x]);
		f2.add(Bg[x],1);
	}
}
void del(int x){
	if(s[x]=='A'){
		tot-=f2.qry(En[x])-f2.qry(Bg[x]-1);
		f1.add(Bg[x],-1);f1.add(En[x]+1,1);
	}else{
		tot-=f1.qry(Bg[x]);
		f2.add(Bg[x],-1);
	}
}
int BB,t1[N],t2[N],To[N],CC,t3[N];
struct block{
	int f[K*2],Pt,id,siz;ll sum;
	void clear(int x){Me(f,0);id=x;Pt=BB;sum=siz=0;}
	void add(int x){if(x>=0) siz++,sum+=x;if(abs(x)<=BB) f[Pt+x]++;}
	void ins(int x){
		if(x==1) Pt--,sum+=siz,siz+=f[Pt];
		else siz-=f[Pt],sum-=siz,Pt++;
	}
}f[K*4];
int newn(int x){f[++CC].clear(x);return CC;}
int g1[N],g2[N],A[N];
void dfs3(int x,int Is){
	while(!t1[x]) {
		if(s[x]=='?')f[t1[Is]].add(A[x]);t2[x]=1;x=fa[x];
	}
}
void add1(int x,int w){
	for(int i=1;i<=CC;i++) if(t1[f[i].id]==i){
		if(Bg[f[i].id]>Bg[x]&&Bg[f[i].id]<=En[x]) f[i].ins(w),A[f[i].id]+=w;
	}else {
		if(Bg[f[i].id]>=Bg[x]&&Bg[f[i].id]<=En[x]) f[i].ins(w);
	}
}
void add2(int x,int w){
	int op=1;while(x){
		if(op) f[t1[x]].ins(w),x=To[x];
		else A[x]+=w;
		op^=1;
	}
}
int g[N];
void Solve(){
	int i,j;scanf("%d%d",&n,&m);BB=sqrt(m);
	scanf("%s",s+1);
	for(i=2;i<=n;i++) scanf("%d",&fa[i]),S[fa[i]].emplace_back(i);
	Make(1);
	for(i=1;i<=n;i++) ins(i);
	for(i=1;i<=m;i++) scanf("%d",&x[i]),Gc(),c[i]=Gc();
	for(i=1;i<=m;i++){
		if((i-1)%BB==0){
			Me(t1,0);Me(To,0);Me(t3,0);Me(t2,0);CC=0;
			for(j=i;j<min(i+BB,m+1);j++) if(!t1[x[j]]) t1[x[j]]=newn(x[j]),t3[x[j]]=newn(x[j]);
			if(!t1[1]) t1[1]=newn(1),t3[1]=newn(1);
			Me(g,0);for(j=n;j;j--) t1[j]&&(g[j]=n+1),g[fa[j]]+=(g[j]>0),g[j]>1&&!t1[j]&&(t1[j]=newn(j),t3[j]=newn(j));
			for(j=2;j<=n;j++) if(t1[j]) {
				int x=fa[j];while(!t1[x]) x=fa[x];To[j]=x;
			}
			for(j=2;j<=n;j++) g2[j]=g2[fa[j]]+(s[fa[j]]=='A'||s[fa[j]]=='?');
			Me(g1,0);for(j=n;j>1;j--) g1[fa[j]]+=g1[j]+(s[j]=='C'||s[j]=='?');
			for(j=1;j<=n;j++) A[j]=g1[j]-g2[j];
			Me(t2,0);
			for(j=2;j<=n;j++) if(t1[j]) dfs3(fa[j],j);
			Me(g,0);for(j=1;j<=n;j++) if(t1[j]) g[j]=j;else g[j]=g[fa[j]],!t2[j]&&s[j]=='?'&&(f[t3[g[j]]].add(A[j]),0); 
		}
		int w=(s[x[i]]=='A'||s[x[i]]=='?'?1:0)+(c[i]=='A'||c[i]=='?'?-1:0);
		if(w) add1(x[i],w);
		w=(s[x[i]]=='C'||s[x[i]]=='?'?-1:0)+(c[i]=='C'||c[i]=='?'?1:0);
		if(w) add2(x[i],w);
		del(x[i]);
		s[x[i]]=c[i];
		ins(x[i]);
		ll ans=0;for(j=1;j<=CC;j++){
			ans+=f[j].sum;
			if(j==t1[f[j].id]&&s[f[j].id]=='?') ans+=max(A[f[j].id],0); 
		} 
		printf("%lld\n",ans+tot);
	}
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}