#include <bits/stdc++.h>
      
#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )
#define REP(i,n) FOR(i,0,n)
#define YYS(x,arr) for(auto& x:arr)
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort( (x).begin(),(x).end() )
#define REVERSE(x) reverse( (x).begin(),(x).end() )
#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )
#define PW(x) (1LL<<(x))
#define SZ(x) ((ll)(x).size())
#define SHOW(x) cout << #x << " = " << x << endl
#define SHOWA(x,n) for( int yui = 0; yui < n; yui++ ){ cout << x[yui] << " "; } cout << endl

#define pb emplace_back
#define fi first
#define se second

using namespace std;

typedef long double ld;
typedef long long int ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<ld> vd;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpl> gr;
typedef vector<vl> ml;
typedef vector<vd> md;
typedef vector<vi> mi;
     
const ll INF = (ll)1e9 + 10;
const ll INFLL = (ll)1e18 + 10;
const ld EPS = 1e-12;
const ll MOD = 1e9+7;
     
template<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }
template<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }
template<class T> inline T sq( T a ){ return a * a; }

ll in(){ long long int x; scanf( "%lld" , &x ); return x; }
char yuyushiki[1000010]; string stin(){ scanf( "%s" , yuyushiki ); return yuyushiki; }

// head

int n;
int arr[400010];

struct LazySegtree{
  vector<int> node, lazy;
  int size;
  inline void push( int k , int l , int r ){
    if(lazy[k]){
      node[k] = r - l - node[k];
      if(k*2+2 < SZ(lazy)){
        lazy[k*2+1] = 1 - lazy[k*2+1];
        lazy[k*2+2] = 1 - lazy[k*2+2];
      }
      lazy[k] = 0;  
    }
  }
  void init( int n ){
    size = 1;
    while( size < n ) size *= 2;
    lazy = vector<int>( size*2-1 , 0 );
    node = vector<int>( size*2-1 , 0 );
  }
  void init_segment_tree(ll k, ll l, ll r){
    if(r - l == 1){
      // cout << k << " " << l << " " << r << " " << arr[l] << endl;
      node[k] = arr[l];
    } else {
      init_segment_tree(k*2+1, l, (l+r)/2);
      init_segment_tree(k*2+2, (l+r)/2, r);
      node[k] = node[k*2+1] + node[k*2+2];
    }
  }
  void init_segment_tree(){  
    init_segment_tree(0, 0, size);
  }
  void update( int a , int b , int k , int l , int r ){
    push( k , l , r );
    if( a <= l && r <= b ){
      lazy[k] = 1 - lazy[k];
      push( k , l , r );
    } else if( b <= l || r <= a ){
      return;
    } else {
      update( a , b , k*2+1 , l , (l+r)/2 );
      update( a , b , k*2+2 , (l+r)/2 , r );
      node[k] = node[k*2+1] + node[k*2+2];
    }
  }
  void update( int a , int b ){
    update( a , b , 0 , 0 , size );
  }
  int query( int a , int b , int k , int l , int r ){
    push( k , l , r );
    if( a <= l && r <= b ){
      // cout << "* " << a << " " << b << " " << k << " " << l << " " << r << " " << node[k] << endl;
      return node[k];
    } else if( b <= l || r <= a ){
      return 0;
    } else {
      int chl = query( a , b , k*2+1 , l , (l+r)/2 );
      int chr = query( a , b , k*2+2 , (l+r)/2 , r );
      // cout << a << " " << b << " " << k << " " << l << " " << r << " " << chl + chr << endl;
      return chl + chr;
    }
  }
  int query( int a , int b ){
    return query( a , b , 0 , 0 , size );
  }
};

int q;

vi G[100010];

int cnt;

int ins[100010];
int outs[100010];

LazySegtree seg;

int dfs(int x){
  ins[x] = cnt++;
  YYS(w, G[x]){
    dfs(w);
  }
  outs[x] = cnt;
}

int main(){

  n = in();
  q = in();
  FOR( i , 1 , n ){
    int p = in() - 1;
    G[p].pb( i );
  }

  dfs(0);
  
  REP( i , n ){
    string s = stin();
    // cout << s << " " << ins[i] << endl;
    if(s[0] == 'G'){
      arr[ins[i]] = 1;
    } else {
      arr[ins[i]] = 0;
    }
  }

  seg.init(n);
  seg.init_segment_tree();

  /*
  cout << seg.query(0, n) << endl;
  cout << seg.node[0] << endl;

  return 0;
  */
  
  REP( i , q ){
    int a = in() - 1;
    seg.update(ins[a], outs[a]);
    /*
    REP( j , n ){
      cout << seg.query(j, j+1) << " ";
    }
    cout << endl;
    */
    int ans = seg.query(0, n);
    if(ans*2 > n){
      puts("broccoli");
    } else {
      puts("cauliflower");
    }
  }

  return 0;
}



Measured memory_bytes: 14712