using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
//using System.Numerics;
using Enu = System.Linq.Enumerable;
using System.Threading;

public class Program
{
    static readonly int MaxN = (int)1e5;
    static readonly int MaxQ = (int)1e5;
    static readonly int Unknown = -1;
    int N, Q;
    int[] Parent = new int[MaxN];
    int[] MarkCount = new int[MaxN];
    int[] MarkedAncestor = new int[MaxN];
    char[] Qtype = new char[MaxQ];
    int[] Qwho = new int[MaxQ];

    public void Solve()
    {
        while (true)
        {
            N = Reader.Int();
            Q = Reader.Int();
            if (N == 0) break;
            for (int i = 1; i < N; i++)
                Parent[i] = Reader.Int() - 1;
            for (int i = 0; i < Q; i++)
            {
                Qtype[i] = Reader.String()[0];
                Qwho[i] = Reader.Int() - 1;
            }
            Calc();
        }
        Console.ReadLine();
    }

    private void Calc()
    {
        MarkCount[0] = 1;
        MarkedAncestor[0] = 0;
        for (int i = 1; i < N; i++)
        {
            MarkCount[i] = 0;
            MarkedAncestor[i] = Unknown;
        }
        for (int i = 0; i < Q; i++)
            if (Qtype[i] == 'M')
            {
                MarkCount[Qwho[i]]++;
                MarkedAncestor[Qwho[i]] = Qwho[i];
            }

        long ans = 0;
        for (int i = Q - 1; i >= 0; i--)
            if (Qtype[i] == 'Q')
                ans += 1 + WhoMarked(Qwho[i]);
            else
                MarkCount[Qwho[i]]--;
        Console.WriteLine(ans);
    }

    private int WhoMarked(int v, int depth = 1)
    {
        int a = MarkedAncestor[v];
        if (a != Unknown && MarkCount[a] > 0) return a;
        return MarkedAncestor[v] = WhoMarked(Parent[v], depth + 1);
    }

}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    static T[] Range<T>(int N, Func<T> f) { return Enu.Range(0, N).Select(i => f()).ToArray(); }
    static string[] Split(string s) { return s.Split(separator, op); }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}

Measured memory_bytes: 15332