#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,NAME,...) NAME
#define pr(...) GET_MACRO(__VA_ARGS__,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define pr1(a) (#a)<<"="<<(a)
#define pr2(a,b) pr1(a)<<", "<<pr1(b)
#define pr3(a,b,c) pr2(a,b)<<", "<<pr1(c)
#define pr4(a,b,c,d) pr3(a,b,c)<<", "<<pr1(d)
#define pr5(a,b,c,d,e) pr4(a,b,c,d)<<", "<<pr1(e)
#define int long long
#define double long double
using namespace std;
const int N = 100010;
const int INF = 1LL<<55;
const int mod = (1e9)+7;
const double EPS = 1e-8;
const double PI = 6.0 * asin(0.5);
typedef pair<int,int> P;
typedef long long ll;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
ostream& operator<<(ostream& o,P p){return o<<"("<<p.first<<","<<p.second<<")";}
istream& operator>>(istream& i,P &p){return i>>p.first>>p.second;}
ostream& operator<<(ostream& o,vector<auto> &a){int i=0;for(auto t:a)o<<(i++?" ":"")<<t;return o;}
istream& operator>>(istream& i,vector<auto> &a){for(auto &t:a)i>>t;return i;}
void prArr(auto a,string s=" "){int i=0;for(auto t:a)cout<<(i++?s:"")<<t;cout<<endl;}

class Seg{
public: 
  
  //遅延用の型  
  struct T{
    bool type; //0 - empty   , 1 - update
    int value;
    T():type(0),value(0){}
    T(bool type,int value):type(type),value(value){}
  };

  //比較可能な主データ型
  struct D{
    int w,g;
    D():w(0),g(0){} /*適切な値にする!!!!!!*/
    D(int w,int g):w(w),g(g){}
  };
  
  
  int n;
  vector<D> dat;
  vector<T> td;
  int toMax; //0 -> RangeMin, 1 -> RangeMax
  
  Seg(){n=-1;}
  Seg(int n_,int toMax = 0){
    this->toMax = toMax;
    n=1;
    while(n<n_)n*=2;
    td.resize(2*n-1,T());
    dat.resize(2*n-1,D());
  }
  
  void updateAdd(int i,int w,int v = 1,int flag = 0){
    //cout<<pr(i,w,v,flag)<<endl;
    if(flag == 0) i += n-1;
    
    if(w) dat[i].w+=v;
    else dat[i].g+=v;
    while(i){
      i = (i-1)/2;
      if(w) dat[i].w+=v;
      else dat[i].g+=v;

    }
  }
  
  
  D merge(D a,D b){return D(a.w+b.w,a.g+b.g);}
  
  void delay(int k){
    if(td[k].type==0) return;
    int v = td[k].value;
    td[k].type = 0;
    td[k].value = 0;
    
    int l = k*2+1,r = k*2+2;
    if(v%2 == 1) {
      swap(dat[l].w,dat[l].g);
      swap(dat[r].w,dat[r].g);
    }
    

    td[l].type = 1; td[l].value += v;

    td[r].type = 1; td[r].value += v;
  }

  D update(int k,int x){
    td[k].type = 1;
    td[k].value += x;
    swap(dat[k].w,dat[k].g);
    return dat[k];
  }
  
  //[a,b)の値をx加算　add(a,b,x)
  D add(int a,int b,int x,bool flg=true,int k=0,int l=0,int r=-1){
    if(r==-1 && toMax) x *= -1; 
    if(r==-1) r=n, assert(a < n && b <= n);
    if(r<=a||b<=l) return flg? dat[k]:D(0,0);
    if(a<=l&&r<=b) return flg? update(k,x):dat[k];
    
    delay(k);
    D vl = add(a,b,x,flg,k*2+1,l,(l+r)/2);
    D vr = add(a,b,x,flg,k*2+2,(l+r)/2,r);
    if(flg) dat[k] = merge(vl,vr);
    return merge(vl,vr);
  }
  
  //[a,b)の最小値を得る　find(a,b);
  P find(int a,int b){
    D res = add(a,b,0,false);
    return P(res.w,res.g);
  }
};


vector<vector<int> > G;
vector<int> L;
void dfs(int pos = 0,int pre = 0){
  L.push_back(pos);
  for(auto to:G[pos]){
    if(to == pre) continue;
    dfs(to,pos);
  }
  L.push_back(pos);
  
}

signed main(){
  int n,Q;
  cin>>n>>Q;
  
  G.resize(n);
  for(int i=1;i<n;i++){
    int p;
    cin>>p; p--;
    G[i].push_back(p); 
    G[p].push_back(i);
  }

  vector<char> C(n);
  cin>>C;

  dfs();

  vector<P> Idx;
  
  set<int> s;
  Seg seg(n);
  for(int i=0;i<(int)L.size();i++) {
    Idx.push_back(P(L[i],s.size()));
    if(!s.count(L[i]))
      seg.updateAdd(s.size(),C[L[i]] == 'W');
    s.insert(L[i]);
  }
  sort(Idx.begin(),Idx.end());

  //cout<<"Idx:"; prArr(Idx);
  


  //cout<<pr(L)<<endl;
  while(Q--){
    int v;
    cin>>v; v--;
    auto a = *lower_bound(Idx.begin(),Idx.end(),P(v,-1));
    auto b = *upper_bound(Idx.begin(),Idx.end(),a);
    assert(a.first == v && b.first == v);
    //cout<<pr(a.second,b.second)<<endl;
    seg.add(a.second,b.second,1);
    int w,g; tie(w,g) = seg.find(0,n);
    
    //cout<<pr(w,g)<<endl;
    int ans = g > w;
    cout<<(ans? "broccoli":"cauliflower")<<endl;
    
  }
  
  return 0;
}



Measured memory_bytes: 31608