// Slower C++ solution:
#include <iostream>

#include <vector>

#include <queue>

#include <stack>

using namespace std;



// 并?集相?数据与算法

#define MAX_N 100000 + 16

int parent[MAX_N];

int height[MAX_N];



void init(const int& n)

{

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

	{

		parent[i] = i;

		height[i] = 0;

	}

}



int find(const int& x)

{

	if (parent[x] == x)

	{

		return x;

	}

	else

	{

		return parent[x] = find(parent[x]);

	}

}



void unite(int x, int y)

{

	x = find(x);

	y = find(y);

	if (x == y)

	{

		return;

	}



	if (height[x] < height[y])

	{

		parent[x] = y;

	}

	else

	{

		parent[y] = x;

		if (height[x] == height[y])

		{

			++height[x];

		}

	}

}



bool same(const int& x, const int& y)

{

	return find(x) == find(y);

}

// End Of 并?集



// 原始的?用它来描述

vector<int> children[MAX_N];

int parent_tree[MAX_N];

bool marked[MAX_N];

int ancestor[MAX_N];

// ?条指令被拆分? 操作 + 目?

stack<char> operation;

stack<int>  target;



void bfs(int index, int the_ancestor)

{

	queue<int> q_index;

	queue<int> q_ancestor;

	q_index.push(index);

	q_ancestor.push(the_ancestor);

	while (!q_index.empty())

	{

		the_ancestor = q_ancestor.front(); q_ancestor.pop();

		index = q_index.front(); q_index.pop();

		if (marked[index] == true)

		{

			the_ancestor = index;

		}

		ancestor[index] = the_ancestor;

		for (vector<int>::iterator it = children[index].begin(); it != children[index].end(); ++it)

		{

			q_index.push(*it);

			q_ancestor.push(the_ancestor);

		}

	}

}



int main(int argc, char *argv[])

{



	int N, Q;

	while (cin >> N, cin >> Q, N)

	{

		for (int i = 0; i < N; ++i)

		{

			children[i].clear();

			marked[i] = false;

		}

		marked[0] = true;

		int p;

		for (int i = 1; i < N; ++i)

		{

			cin >> p; --p;

			parent_tree[i] = p;

			children[p].push_back(i);

		}

		for (int i = 0; i < Q; ++i)

		{

			char o;

			int t;

			cin >> o >> t; --t;

			if (o == 'M')

			{

				if (marked[t])

				{

					continue;

				}

				else

				{

					marked[t] = true;

				}

			}

			operation.push(o);

			target.push(t);

		}

		bfs(0, 0);

		init(N);

		for (int i = 0; i < N; ++i)

		{

			unite(i, ancestor[i]);

		}

		unsigned long long result = 0;

		while (!operation.empty())

		{

			char o = operation.top(); operation.pop();

			int t = target.top(); target.pop();

			if (o == 'Q')

			{

				result += ancestor[find(t)] + 1;	// ?目index从1?始

			}

			else

			{

				// ?行“反染色”操作，之后?个?点的祖先??其父?点的祖先

				int p = ancestor[find(parent_tree[t])];

				unite(t, parent_tree[t]);

				ancestor[find(t)] = p;

			}

		}

		cout << result << endl;

	}

	



	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.526714598422814x):
#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;

}