// 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);

		}

	}

}

 

///////////////////////////SubMain//////////////////////////////////

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.3818313718090254x):
#include <iostream>

#include <string.h>

#include <vector>

#include <queue>

#include <functional>

#include <algorithm>

using namespace std;



const int MAXN = 100010;

const int MAXM = 100010;

const int INF = 0x3f3f3f3f;

typedef long long LL;

typedef pair<int, int> P;



int N, Q;

int father[MAXN];

bool vis[MAXN];



void Init() {

	for (int i = 0; i < MAXN; ++i) {

		father[i] = i;

	}

}

int Find(int x) {

	while (!vis[x])

		x = father[x];

	return x;

}



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

#ifdef LOCAL

	freopen("input.txt", "r", stdin);

	freopen("output.txt", "w", stdout);

#endif

	while (scanf("%d%d", &N, &Q) != EOF && !(N == 0 && Q == 0)) {

		int a, b;

		LL res = 0;

		char opt[5];

		Init();

		fill(vis, vis + MAXN, false);

		vis[1] = true;

		for (int i = 2; i <= N; ++i) {

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

		}

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

			scanf("%s %d", opt, &b);

			if (opt[0] == 'Q') {

				res += Find(b);

			}

			else

				vis[b] = true;

		}

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

	}

	//system("pause");

	return 0;

}