#include<bits/stdc++.h>

using namespace std;

using int64 = long long;

template< typename Monoid, typename OperatorMonoid = Monoid >
struct LazySegmentTree {
  using F = function< Monoid(Monoid, Monoid) >;
  using G = function< Monoid(Monoid, OperatorMonoid) >;
  using H = function< OperatorMonoid(OperatorMonoid, OperatorMonoid) >;
  using P = function< OperatorMonoid(OperatorMonoid, int) >;

  int sz;
  vector< Monoid > data;
  vector< OperatorMonoid > lazy;
  const F f;
  const G g;
  const H h;
  const P p;
  const Monoid M1;
  const OperatorMonoid OM0;


  LazySegmentTree(int n, const F f, const G g, const H h, const P p,
                  const Monoid &M1, const OperatorMonoid OM0)
      : f(f), g(g), h(h), p(p), M1(M1), OM0(OM0) {
    sz = 1;
    while(sz < n) sz <<= 1;
    data.assign(2 * sz, M1);
    lazy.assign(2 * sz, OM0);
  }

  void set(int k, const Monoid &x) {
    data[k + sz] = x;
  }

  void build() {
    for(int k = sz - 1; k > 0; k--) {
      data[k] = f(data[2 * k + 0], data[2 * k + 1]);
    }
  }

  void propagate(int k, int len) {
    if(lazy[k] != OM0) {
      if(k < sz) {
        lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
        lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
      }
      data[k] = g(data[k], p(lazy[k], len));
      lazy[k] = OM0;
    }
  }

  Monoid update(int a, int b, const OperatorMonoid &x, int k, int l, int r) {
    propagate(k, r - l);
    if(r <= a || b <= l) {
      return data[k];
    } else if(a <= l && r <= b) {
      lazy[k] = h(lazy[k], x);
      propagate(k, r - l);
      return data[k];
    } else {
      return data[k] = f(update(a, b, x, 2 * k + 0, l, (l + r) >> 1),
                         update(a, b, x, 2 * k + 1, (l + r) >> 1, r));
    }
  }

  Monoid update(int a, int b, const OperatorMonoid &x) {
    return update(a, b, x, 1, 0, sz);
  }


  Monoid query(int a, int b, int k, int l, int r) {
    propagate(k, r - l);
    if(r <= a || b <= l) {
      return M1;
    } else if(a <= l && r <= b) {
      return data[k];
    } else {
      return f(query(a, b, 2 * k + 0, l, (l + r) >> 1),
               query(a, b, 2 * k + 1, (l + r) >> 1, r));
    }
  }

  Monoid query(int a, int b) {
    return query(a, b, 1, 0, sz);
  }

  Monoid operator[](const int &k) {
    return query(k, k + 1);
  }
};


int N, Q;
vector< int > g[100000];
int in[100000], out[100000];
vector< int > order;

void dfs(int idx) {
  in[idx] = order.size();
  order.emplace_back(idx);
  for(auto &to : g[idx]) dfs(to);
  out[idx] = order.size();
}

int main() {
  cin >> N >> Q;
  for(int i = 1; i < N; i++) {
    int p;
    cin >> p;
    g[--p].emplace_back(i);
  }
  dfs(0);

  using pi = pair< int, int >;
  auto f = [](pi a, pi b) -> pi {
    return pi(a.first + b.first, a.second + b.second);
  };
  auto g = [](pi a, int t) {
    t %= 2;
    if(t) return pi(a.second, a.first);
    return a;
  };
  auto h = [](int a, int b) {
    return a + b;
  };
  auto p = [](int a, int b) {
    return a;
  };
  LazySegmentTree< pi, int > seg(N, f, g, h, p, pi(), 0);
  for(int i = 0; i < N; i++) {
    char c;
    cin >> c;
    seg.set(in[i], c == 'G' ? pi(1, 0) : pi(0, 1));
  }
  seg.build();


  while(Q--) {
    int v;
    cin >> v;
    --v;
    seg.update(in[v], out[v], 1);
    cout << (seg.query(0, N).first >= (N + 1) / 2 ? "broccoli" : "cauliflower") << endl;

  }


}




Measured memory_bytes: 17500