//#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>

#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>

#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>


using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false

//debug
#define DEBUG

#define DUMPOUT cout

#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() {DUMPOUT << endl;};

template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}

//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n, q;
vector<vector<int>> g(100000 + 5);
int l[100000 + 5], r[100000 + 5];
int idx;

void dfs(int now, int par) {
  l[now] = idx++;
  for (auto nx : g[now]) {
    if (nx == par) continue;
    dfs(nx, now);
  }
  r[now] = idx++;
}

struct SegTree {
  int size;
  vector<int> node, lazy;

  SegTree (int n) {
    size = 1;
    while (size < n) size *= 2;
    node.resize(2 * size - 1, 0);
    lazy.resize(2 * size - 1, 0);
  }

  void eval(int l, int r, int k) {
    if (lazy[k] == 1) {
      node[k] = r - l - node[k];
    }
    if (r - l > 1) {
        lazy[2 * k + 1] ^= lazy[k];
        lazy[2 * k + 2] ^= lazy[k];
    }
    lazy[k] = 0;
  }

  void update(int k) {
    k += size - 1;
    node[k] = 1;
    while (k > 0) {
      k--;
      k /= 2;
      node[k] = node[2 * k + 1] + node[2 * k + 2];
    }
  }

  void rev(int L, int R, int k, int nodeL, int nodeR) {
    eval(nodeL, nodeR, k);
    if (nodeR <= L || R <= nodeL) return;
    if (L <= nodeL && nodeR <= R) {
        lazy[k] ^= 1;
        eval(nodeL, nodeR, k);
        return;
    }
    int nodeM = (nodeL + nodeR) / 2;
    rev(L, R, 2 * k + 1, nodeL, nodeM);
    rev(L, R, 2 * k + 2, nodeM, nodeR);
    node[k] = node[2 * k + 1] + node[2 * k + 2];
  }
  void rev(int L, int R) {
      rev(L, R, 0, 0, size);
  }

  int get(int queryL, int queryR, int k, int nodeL, int nodeR) {
    eval(nodeL, nodeR, k);
    if (nodeR <= queryL || queryR <= nodeL) return 0;
    if (queryL <= nodeL && nodeR <= queryR) {
        return node[k];
    }
    int nodeM = (nodeL + nodeR) / 2;
    int vl = get(queryL, queryR, 2 * k + 1, nodeL, nodeM);
    int vr = get(queryL, queryR, 2 * k + 2, nodeM, nodeR);
    return vl + vr;
  }
  int get(int queryL, int queryR) {
    return get(queryL, queryR, 0, 0, size);
  }
};

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> q;
  SegTree seg(2 * n);
  rep2(i, 1, n) {
    int p;
    cin >> p;
    p--;
    g[p].push_back(i);
  }
  dfs(0, -1);
  rep(i, n) {
    char c;
    cin >> c;
    if (c == 'G') {
      seg.update(l[i]);
      seg.update(r[i]);
    }
  }
  rep(i, q) {
    int v;
    cin >> v;
    v--;
    seg.rev(l[v], r[v] + 1);
    if (seg.get(l[0], r[0] + 1) > n) cout << "broccoli" << endl;
    else cout << "cauliflower" << endl;
  }
}



Measured memory_bytes: 22904