#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"

template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<" ";}return s;}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<"{"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;}s<<"}"<<endl;return s;}

const ll mod=1e9+7;
const ll inf=1e17;
const int INF=1e9;
const double PI=acos(-1);
const double EPS=1e-10;

//区間加算と区間和
/*
verified by
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3982700#1
*/
struct LazySegmentTree{
private:
    int n;
    vector<ll> node,lazy;
    vector<bool> lazyFlag;
 
public:
    LazySegmentTree(){
        int sz=200050;
        n=1;
		while(n < sz) n*=2;
        node.resize(2*n-1,0);
        lazy.resize(2*n-1,0);
        lazyFlag.resize(2*n-1,false);
    }
    void lazyEvaluate(int k,int l,int r){
        if(lazyFlag[k]){
			if(lazy[k]){
				node[k]=(r-l)-node[k];
			}
            if(r-l>1) {
                lazy[k*2+1]^=lazy[k];
                lazy[k*2+2]^=lazy[k];
                lazyFlag[k*2+1]=lazyFlag[k*2+2]=true;
            }
            lazyFlag[k]=false;
            lazy[k]=0;
        }
    }
    void update(int a,int b,ll x,int k=0,int l=0,int r=-1){
        if(r<0) r=n;
        lazyEvaluate(k,l,r);
        if(b<=l || r<=a) return ;
        if(a<=l && r<=b) {
            lazy[k]^=x;
            lazyFlag[k]=true;
            lazyEvaluate(k,l,r);
        }
        else{
            update(a,b,x,2*k+1,l,(l+r)/2);
            update(a,b,x,2*k+2,(l+r)/2,r);
            node[k]=node[2*k+1]+node[2*k+2];
        }
    }
 
    ll getsum(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        lazyEvaluate(k, l, r);
        if(b <= l || r <= a) return 0;
        if(a <= l && r <= b) return node[k];
        ll vl = getsum(a, b, 2*k+1, l, (l+r)/2);
        ll vr = getsum(a, b, 2*k+2, (l+r)/2, r);
        return vl+vr;
    }
};

int main(){
	cin.tie(0);ios::sync_with_stdio(false);
	int n,q;
	cin>>n>>q;
	vector<vector<int>> g(n);
	FOR(i,1,n){
		int p;
		cin>>p;
		p--;
		g[i].push_back(p);
		g[p].push_back(i);
	}
	vector<int> in(n),out(n);
	LazySegmentTree seg;
	int t=0;
	auto dfs=[&](auto &dfs,int v,int pre)->void{
		in[v]=t;
		t++;
		for(auto to:g[v]){
			if(to==pre) continue;
			dfs(dfs,to,v);
		}
		out[v]=t;
	};
	dfs(dfs,0,-1);
	rep(i,n){
		char c;
		cin>>c;
		if(c=='G') seg.update(in[i],in[i]+1,1);
	}
	while(q--){
		int v;
		cin>>v;
		v--;
		seg.update(in[v],out[v],1);
		if(2*seg.getsum(0,n)>n) cout<<"broccoli"<<endl;
		else cout<<"cauliflower"<<endl;
	}
}


Measured memory_bytes: 20916