# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
#include <stdio.h>
#include<time.h>
#include <stdlib.h>
#include <cstdint>
#include <cfenv>
#include<fstream>
//#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7;
constexpr long long INF = numeric_limits<LL>::max() / 2;
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr<<#x<<": "<<x<<'\n'
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
struct Fll { LL first, second, third, fourd; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Rrep(i,mf) for(LL i=mf-1;i>=0;i--)
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
struct Edge { LL to, cost; };
struct edge { LL from, to, cost; };
vector<vector<LL>>g;
vector<edge>edges;
vector<Pll>v;
map<Pll, Pll>ma;
set<LL>st;
LL h, w, n, m, k, t, s, p, q, last, cnt, sum, ans, a[210000], b[210000];
string str, ss;
bool f;
char c;
int di[4][2] = { { 0,1 },{ 1,0 },{ 0,-1 },{ -1,0 } };
struct Seg {
	LL n;
	vector<LL>node, lazy;
	Seg(LL n_) {
		n = 1; while (n < n_)n *= 2;
		node.resize(n * 2 - 1);
		lazy.resize(n * 2 - 1);
		rep(i, n)node[n + i - 1] = 0;
		Rrep(i, n - 2)node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
		//区間最小などの時
		//rep(i, n * 2 - 1)lazy[i] = -1;
	}
	//区間の和の遅延
	void eval(LL k, LL l, LL r) {
		if (lazy[k] != 0) {
			node[k] = (r - l + 1) - node[k];
			if (r - l >= 1) {
				lazy[k * 2 + 1] ^= 1;
				lazy[k * 2 + 2] ^= 1;
			}
			lazy[k] = 0;
		}
	}
	void add(LL l, LL r) {
		add(0, 0, n - 1, l, r);
	}
	void add(LL i, LL a, LL b, LL l, LL r) {
		eval(i, a, b);
		if (b < l || r < a)return;
		if (l <= a && b <= r) {
			lazy[i] ^= 1;
			eval(i, a, b);
		}
		else {
			add(i * 2 + 1, a, (a + b) / 2, l, r);
			add(i * 2 + 2, (a + b + 1) / 2, b, l, r);
			node[i] = node[i * 2 + 1] + node[i * 2 + 2];
		}
	}
	LL getsum(LL l, LL r) {
		return getsum(0, 0, n - 1, l, r);
	}
	LL getsum(LL i, LL a, LL b, LL l, LL r) {
		eval(i, a, b);
		if (b < l || r < a)return 0;
		if (l <= a && b <= r)return node[i];
		return (getsum(i * 2 + 1, a, (a + b) / 2, l, r) + getsum(i * 2 + 2, (a + b + 1) / 2, b, l, r));
	}
};
Seg seg(210000);
LL L[210000], R[210000];
void eular(LL cur,LL par) {
	L[cur] = cnt;
	cnt++;
	rep(i, g[cur].size()) {
		LL v = g[cur][i];
		if (v == par)continue;
		eular(v, cur);
	}
	R[cur] = cnt-1;
}
int main() {
	cin >> n >> q;
	g.resize(n);
	rep(i, n-1) {
		LL x, y;
		cin >> x;
		x--;
		y = i + 1;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	eular(0, -1);
	cnt = 0;
	rep(i, n) {
		char c;
		cin >> c;
		if (c == 'W') {
			seg.add(L[i], L[i]);
		}
	}
	rep(i, q) {
		LL x;
		cin >> x;
		x--;
		seg.add(L[x],R[x]);
		LL w_sum = seg.getsum(0,n-1), g_sum = n - w_sum;
		if (g_sum > w_sum) {
			cout << "broccoli" << endl;
		}
		else {
			cout <<"cauliflower"<< endl;
		}
		//cout << w_sum << " " << g_sum << endl;
	}
	return 0;
}


Measured memory_bytes: 22656