#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &&x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define INSEG(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void PSUM(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(0); ios::sync_with_stdio(false);
        cout << setprecision(15) << fixed;
        // #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

struct union_find {
    vector<int> data;
    union_find(int size) : data(size, -1) {}
    // merge x to y
    void unite(int x, int y) {
        x = root(x); y = root(y);
        if(x != y) {
            data[y] += data[x];
            data[x] = y;
        }
    }
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : (data[x] = root(data[x]));
    }
    int size(int x) {
        return -data[root(x)];
    }
};

signed main() {
    while (1) {
        int N, Q;
        cin >> N >> Q;
        if (N == 0 && Q == 0) break;

        vector<vector<int>> ch(N);
        vector<int> p(N);
        REPF(i, 1, N) {
            int v;
            cin >> v;
            v--;
            p[i] = v;
            ch[v].push_back(i);
        }
        vector<pair<char, int>> query(Q);
        REP(i, Q) {
            cin >> query[i].first >> query[i].second;
            query[i].second--;
        }
        
        union_find uf(N);
        vector<int> marked(N);
        marked[0]++;
        REP(i, Q) {
            if (query[i].first == 'M') marked[query[i].second]++;
        }

        {  // construct
            stack<int> st;
            st.push(0);
            while (!st.empty()) {
                int v = st.top(); st.pop();
                if (marked[v] == 0) uf.unite(v, p[v]);
                FORE(w, ch[v]) {
                    st.push(w);
                }
            }
        }

        int ans = 0;
        REPR(i, Q - 1) {
            int v = query[i].second;
            if (query[i].first == 'M') {
                marked[v]--;
                if (marked[v] == 0) uf.unite(v, p[v]);
            } else {
                ans += uf.root(v) + 1;
            }
        }
        cout << ans << endl;
    }
    return (0^_^0);
}




Measured memory_bytes: 12236