// Slower C++ solution:
#include <stdio.h>

#include <stdlib.h>

#include <cmath>

#include <string.h>

#include <iostream>

#include<algorithm>

#include <queue>

#include <vector>

#include<string>

//******************************************************

#define lrt (rt*2)

#define rrt  (rt*2+1)

#define LL long long

#define inf 0x3f3f3f3f

#define pi acos(-1.0)

#define exp 1e-8

const double temp=(1+sqrt(5))/2;

//***************************************************

#define eps             1e-8

#define inf             0x3f3f3f3f

#define INF             2e18

#define LL              long long

#define ULL             unsigned long long

#define PI              acos(-1.0)

#define pb              push_back

#define mk              make_pair



#define all(a)          a.begin(),a.end()

#define rall(a)         a.rbegin(),a.rend()

#define SQR(a)          ((a)*(a))

#define Unique(a)       sort(all(a)),a.erase(unique(all(a)),a.end())

#define min3(a,b,c)     min(a,min(b,c))

#define max3(a,b,c)     max(a,max(b,c))

#define min4(a,b,c,d)   min(min(a,b),min(c,d))

#define max4(a,b,c,d)   max(max(a,b),max(c,d))

#define max5(a,b,c,d,e) max(max3(a,b,c),max(d,e))

#define min5(a,b,c,d,e) min(min3(a,b,c),min(d,e))

#define Iterator(a)     __typeof__(a.begin())

#define rIterator(a)    __typeof__(a.rbegin())

#define FastRead        ios_base::sync_with_stdio(0);cin.tie(0)

#define CasePrint       pc('C'); pc('a'); pc('s'); pc('e'); pc(' '); write(qq++,false); pc(':'); pc(' ')

#define vi              vector <int>

#define vL              vector <LL>

#define For(I,A,B)      for(int I = (A); I < (B); ++I)

#define rFor(I,A,B)     for(int I = (A); I >= (B); --I)

#define Rep(I,N)        For(I,0,N)

using namespace std;

const int maxn=1e5+10;

int pre[maxn];

void iint()

{

    for(int i=0;i<maxn;i++) pre[i]=i;

}

int find(int x)

{

    return x==pre[x]?x:find(pre[x]);

}

void join(int x,int y)

{

    int fx=find(x),fy=find(y);

    if(fx!=fy)  pre[fx]=fy;

}

int main()

{

    int n,k,num;

    char str[5];

    while(cin>>n>>k)

    {

        LL sum=0;

        if(n+k==0)  break;

        iint();

        for(int i=2;i<=n;i++)

        {

            scanf("%d",&pre[i]);

        }

        while(k--)

        {

            scanf("%s%d",str,&num);

            if(str[0]=='M') pre[num]=num;

            else if(str[0]=='Q')    sum+=find(num);

        }

        cout<<sum<<endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 7.256114258735003x):
#include<cstdio>

#include<cstring>

#include<algorithm>

#include<vector>

using namespace std;



#define FOR(i,a,b) for(int i=(a),i##_end___=(b);i<i##_end___;i++)

#define DFOR(i,a,b) for(int i=(a)-1,i##_end___=(b);i>=i##_end___;i--)

typedef long long LL;

typedef double DB;

const int V=1e5+5;



int n,m;

int Fa[V];

int Mark[V];



struct Ask{

	char op[4];

	int v;

}Que[V];



int dfs(int v,int tim){return Mark[v]<tim?v:Fa[v]=dfs(Fa[v],tim);}



int main(){

	while(~scanf("%d%d",&n,&m)){

		if(!n&&!m)break;

		

		FOR(i,2,n+1)Mark[i]=1e9,scanf("%d",&Fa[i]);

		FOR(i,1,m+1){

			scanf("%s%d",Que[i].op,&Que[i].v);

			if(Que[i].op[0]=='M')Mark[Que[i].v]=min(Mark[Que[i].v],i);

		}

		

		LL ans=0;

		

		DFOR(i,m+1,1)if(Que[i].op[0]=='Q')ans+=dfs(Que[i].v,i);

		

		printf("%lld\n",ans);

	}

	return 0;

}