#include <cstdio>
#include <cstring>
using namespace std;

#define N 100005
int n,q;
int ps[N],marked[N],dad[N],fq[N];
char op1[N];
int op2[N];

int find(int a) {
	if (dad[a]==a) return a;
	return dad[a]=find(dad[a]);
}

void unify(int a, int b) {
	dad[find(a)]=find(b);
}

int main() {
    memset(fq,-1,sizeof(fq));
	scanf("%d%d",&n,&q);
	for (int i=0;i<n;++i) dad[i]=i;
	for (int i=1;i<n;++i) scanf("%d",ps+i),--ps[i];
	for (int i=0;i<q;++i) {
		scanf(" %c%d",op1+i,op2+i);
		--op2[i];
		if (op1[i]=='M') {marked[op2[i]]=1; if (fq[op2[i]]==-1) fq[op2[i]]=i;}
	}
	for (int i=0;i<n;++i) 
		if (!marked[i])
			unify(i,ps[i]);
	long long ans=0;
	for (int i=q-1;i>=0;--i){
		if (op1[i]=='Q') ans+=find(op2[i])+1;
		else if (op1[i]=='M' && fq[op2[i]] == i) unify(op2[i],ps[op2[i]]);
	}
	printf("%lld\n",ans);
}