#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }





const int MAX_V = 110000;
const int MAX_N = MAX_V * 2;

vector<int> tree[MAX_V];
int cmp[MAX_V*2-1];
int vf[MAX_V], ve[MAX_V];

bool isG[MAX_V];

typedef pair<int,int> pint;
typedef pair<int,int> VAL;
typedef int DELAY;

const VAL UNITY_VAL = pint(0, 0);
const DELAY UNITY_DELAY = 0;


static int SIZE_SEG;
struct SegTree {
    VAL val[4*MAX_N];        // min
    DELAY delay[4*MAX_N];    // +
    
    void init(int n = MAX_N, VAL v = UNITY_VAL, DELAY dv = UNITY_DELAY) {
        SIZE_SEG = 1;
        while (SIZE_SEG < n) SIZE_SEG *= 2;
        for (int i = 0; i < 2*SIZE_SEG-1; ++i) val[i] = v, delay[i] = dv;
    }
    
    inline void init_set(int a, VAL x) {
        a += SIZE_SEG-1; val[a] = x;
    }
    
    inline void init_tree(int k = 0, int l = 0, int r = SIZE_SEG) {
        if (r - l == 1) {}                      // leaf
        else {
            init_tree(k*2+1, l, (l+r)/2);
            init_tree(k*2+2, (l+r)/2, r);
            val[k] = merge(val[k*2+1], val[k*2+2]);
        }
    }
    
    inline VAL merge(VAL a, VAL b) {
	  VAL res = pint(a.first + b.first, a.second + b.second);
        return res;
    }
    
    inline void add(DELAY &d, DELAY x) {
        // d.f += x.f;
		if (x) {
		  d = 1 - d;
		}
    }
    
    inline void reflect(VAL &a, DELAY d, int l, int r) {
        // a.f += d.f * (r-l);
	  if (d) {
		swap(a.first, a.second);
	  }
    }
    
    inline void redelay(int k, int l, int r) {
        reflect(val[k], delay[k], l, r);
        if (k < SIZE_SEG-1) {
            add(delay[k*2+1], delay[k]);
            add(delay[k*2+2], delay[k]);
        }
        delay[k] = UNITY_DELAY;
    }
    
    inline void renode(int k, int l, int r) {
        val[k] = merge(val[k*2+1], val[k*2+2]);
    }
    
    inline void set(int a, int b, DELAY x, int k = 0, int l = 0, int r = SIZE_SEG) {
        if (a <= l && r <= b) {                 // included
            add(delay[k], x);
            redelay(k, l, r);
        }
        else if (a < r && l < b) {              // intersected
            redelay(k, l, r);
            set(a, b, x, k*2+1, l, (l+r)/2);
            set(a, b, x, k*2+2, (l+r)/2, r);
            renode(k, l, r);
        }
        else {                                  // no-intersected
            redelay(k, l, r);
        }
    }
    
    inline VAL get(int a, int b, int k = 0, int l = 0, int r = SIZE_SEG) {
        redelay(k, l, r);
        if (a <= l && r <= b) {                 // included
            return val[k];
        }
        else if (a < r && l < b) {              // intersected
            VAL t1 = get(a, b, k*2+1, l, (l+r)/2);
            VAL t2 = get(a, b, k*2+2, (l+r)/2, r);
            renode(k, l, r);
            
            return merge(t1, t2);
        }
        else {                                  // no-intersected
            return UNITY_VAL;
        }
    }
    
    inline VAL operator [] (int i) {return get(i, i+1);}
    
    void print(long long r = SIZE_SEG) {
        long long t = 2;
        for (int i = 0; i < r*2-1; ++i) {
            cout << make_pair(val[i], delay[i]) << ",";
            if (i == t-2) {cout << endl; t *= 2;}
        }
        for (int i = 0; i < r; ++i) {
            cout << get(i, i+1) << ", ";
        }
        cout << endl << endl;
    }
} seg;






void dfs(int v, int par, int &ord) {
    cmp[ord] = v;
    vf[v] = ve[v] = ord;
    ++ord;
    for (int i = 0; i < tree[v].size(); ++i) {
        int e = tree[v][i];
        if (e != par) {
            dfs(e, v, ord);
            cmp[ord] = v;
			ve[v] = ord;
            ++ord;
        }
    }
}

void init(int V) {
    int k = 0;
    dfs(0, -1, k); 
    
    seg.init( V*2-1 );
    //for (int i = 0; i < V; ++i) seg.set(vf[i], ini[i]);
    //seg.init_tree();
}


int N, Q;

int main() {
  while (cin >> N >> Q) {
	for (int i = 0; i < MAX_V; ++i) tree[i].clear();
	for (int i = 0; i < N-1; ++i) {
	  int p;
	  cin >> p;
	  --p;
	  tree[i+1].push_back(p);
	  tree[p].push_back(i+1);
	}
	
	init(N);

	//set.print();

	/*
	for (int i = 0; i < N*2; ++i) cout << cmp[i] << ", ";
cout << endl;
for (int i = 0; i < N*2; ++i) cout << vf[i] << ", ";
cout << endl;
for (int i = 0; i < N*2; ++i) cout << ve[i] << ", ";
cout << endl;
	*/

	// cmp : ord番目に訪問した頂点, depth : ord番目に訪問した頂点の深さ
// vf : 頂点vの最初の訪問順(RMQのindex, 0-index！)
// ve : 頂点vの最後の訪問順(RMQのindex, 0-index！)
	for (int v = 0; v < N; ++v) {
	  int id = vf[v];
	  char c;
	  cin >> c;
	  if (c == 'G') {
		seg.init_set(id, pint(1, 0));
	  }
	  else {
		seg.init_set(id, pint(0, 1));
	  }
	}
	seg.init_tree();

	pint sum = seg.get(0, N*2+2);
	for (int q = 0; q < Q; ++q) {
	  int v;
	  cin >> v;
	  --v;
	  //COUT(vf[v]);
	  //COUT(ve[v]);
	  seg.set(vf[v], ve[v] + 1, 1);

	  pint sum = seg.get(0, N*2+2);
	  //COUT(sum);
	  if (sum.first > sum.second) puts("broccoli");
	  else puts("cauliflower");

	  //seg.print();
	}
  }
}

/*

// usage
int a = vf[v], b = ve[v];
seg.update(a, b+1, val);        // subtree_update
res = seg.get(a, b+1);          // subtree_get
res = seg.get(a, a+1);          // node_get


// debug
for (int i = 0; i < n*2; ++i) cout << cmp[i] << ", ";
cout << endl;
for (int i = 0; i < n*2; ++i) cout << vf[i] << ", ";
cout << endl;
for (int i = 0; i < n*2; ++i) cout << ve[i] << ", ";
cout << endl;

seg.print();

*/






		  







    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    



Measured memory_bytes: 27168