#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef double ld;
typedef complex<ld> Point;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(iinclude<snt i=sta;i<=n;i++)
const ld eps = 1e-6;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;

typedef pair<int, P> speP;

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

struct SegT {
private:
	int n; vector<ll> node;
	vector<int> cap;
	vector<bool> lazy;
	const ll init_c = 0;
public:
	SegT(int sz) {
		n = 1;
		while (n < sz)n <<= 1;
		node.resize(2 * n - 1, init_c);
		lazy.resize(2 * n - 1, false);
	}
	SegT(vector<int> &v) {
		int sz = v.size();
		n = 1;
		while (n < sz)n <<= 1;
		node.resize(2 * n - 1, init_c);
		lazy.resize(2 * n - 1, 0);
		cap.resize(2 * n - 1, 0);
		rep(i, sz) {
			node[i+n-1] = v[i]; cap[i+n-1] = 1;
		}
		per(i, n - 1) {
			node[i] = f(node[2 * i + 1], node[2 * i + 2]);
			cap[i] = f(cap[2 * i + 1], cap[2 * i + 2]);
		}
	}
	ll f(ll a, ll b) {
		return a + b;
	}
	void eval(int k, int l, int r) {
		if (lazy[k]) {
			node[k] = cap[k] - node[k];
			if (r - l > 1) {
				lazy[2 * k + 1] = !lazy[2 * k + 1];
				lazy[2 * k + 2] = !lazy[2 * k + 2];
			}
			lazy[k] = false;
		}
	}
	void add(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = n;
		eval(k, l, r);
		if (r <= a || b <= l)return;
		if (a <= l && r <= b) {
			lazy[k]=!lazy[k]; eval(k, l, r);
		}
		else {
			add(a, b, k * 2 + 1, l, (l + r) / 2);
			add(a, b, k * 2 + 2, (l + r) / 2, r);
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	ll query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = n;
		eval(k, l, r);
		if (r <= a || b <= l)return init_c;
		if (a <= l && r <= b)return node[k];
		else {
			ll vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			ll vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
};


vector<int> G[1 << 17];

int trans[1 << 17];
int n, q;

int ri[1 << 17];
int cur = 0;
void dfs(int v) {
	trans[v] = cur; cur++;
	rep(j, G[v].size()) {
		int to = G[v][j];
		dfs(to);
	}
	ri[trans[v]] = cur;
}

void solve() {
	cin >> n >> q;
	rep1(i, n-1) {
		int p; cin >> p;
		p--;
		G[p].push_back(i);
	}
	dfs(0);
	vector<int> v(n);
	rep(i, n) {
		char c; cin >> c;
		if (c == 'G')v[trans[i]] = 1;
		else v[trans[i]] = 0;
	}
	SegT st(v);
	rep(i, q) {
		int r; cin >> r; r--;
		r = trans[r];
		st.add(r, ri[r]);
		int z = st.query(0, n);
		if (z > n / 2) {
			cout << "broccoli" << endl;
		}
		else {
			cout << "cauliflower" << endl;
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
	//stop
		return 0;
}


Measured memory_bytes: 18112