#include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
using namespace std;

template<typename Monoid, typename OperatorMonoid>
struct LazySegmentTree {
    using F = function<Monoid(Monoid, Monoid)>;
    using G = function<Monoid(Monoid, OperatorMonoid)>;
    using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;
    const F f;
    const G g;
    const H h;
    const Monoid M1;
    const OperatorMonoid OM0;
    int sz, height;
    vector<Monoid> data;
    vector<OperatorMonoid> lazy;
    LazySegmentTree(int n, const F f, const G g, const H h,
                    const Monoid &M1, const OperatorMonoid &OM0)
        : f(f), g(g), h(h), M1(M1), OM0(OM0), sz(1), height(0)
    {
        while (sz < n) sz <<= 1, height++;
        data.assign(sz * 2, M1);
        lazy.assign(sz * 2, 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[k << 1 | 0], data[k << 1 | 1]);
        }
    }
    inline Monoid reflect(int k) {
        return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
    }
    inline void propagate(int k) {
        if (lazy[k] == OM0) return ;
        lazy[k << 1 | 0] = h(lazy[k << 1 | 0], lazy[k]);
        lazy[k << 1 | 1] = h(lazy[k << 1 | 1], lazy[k]);
        data[k] = reflect(k);
        lazy[k] = OM0;
    }
    inline void thrust(int k) {
        for (int i = height; i > 0; i--) propagate(k >> i);
    }
    inline void recalc(int k) {
        while (k >>= 1) data[k] = f(reflect(k << 1 | 0), reflect(k << 1 | 1));
    }
    void update(int a, int b, const OperatorMonoid &x) {
        thrust(a += sz);
        thrust(b += sz - 1);
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) lazy[l] = h(lazy[l], x), ++l;
            if (r & 1) --r, lazy[r] = h(lazy[r], x);
        }
        recalc(a);
        recalc(b);
    }
    Monoid get(int a, int b) {
        thrust(a += sz);
        thrust(b += sz - 1);
        Monoid L = M1, R = M1;
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) L = f(L, reflect(l++));
            if (r & 1) R = f(reflect(--r), R);
        }
        return f(L, R);
    }
    Monoid operator[](const int &k) { return get(k, k + 1); }
};

struct EulerTourOnVertex {
    vector<int> posL, posR, dep;
    vector<vector<int>> g;
    int pos;
    EulerTourOnVertex(int n) : posL(n), posR(n), dep(n), g(n), pos(0) { }
    void add_edge(int u, int v) { g[u].emplace_back(v); g[v].emplace_back(u); }
    void dfs(int u, int p) {
        posL[u] = pos++;
        for (int v: g[u]) if (v != p) dep[v] = dep[u] + 1, dfs(v, u);
        posR[u] = pos;
    }
    void build(int r = 0) { dfs(r, -1); }
    bool has(int r, int x) { return posL[r] <= posL[x] && posR[x] <= posR[r]; }
};

int main() {
    int n, q; cin >> n >> q;
    EulerTourOnVertex et(n);
    for (int i = 1; i < n; i++) {
        int p; cin >> p; p--;
        et.add_edge(p, i);
    }
    et.build();
    using T = int;
    using E = int;
    auto f = [](T a, T b) { return T(a + b); };
    auto g = [](T a, E b) { return T(a * b); };
    auto h = [](E a, E b) { return E(a * b); };
    LazySegmentTree<T, E> seg(n + 1, f, g, h, T(0), E(1));
    for (int i = 0; i < n; i++) {
        char c; cin >> c;
        seg.set(et.posL[i], T(c == 'G' ? 1 : -1));
    }
    seg.build();
    while (q--) {
        int u; cin >> u; u--;
        seg.update(et.posL[u], et.posR[u], E(-1));
        T res = seg.get(et.posL[0], et.posR[0]);
        cout << (res > 0 ? "broccoli" : "cauliflower") << endl;
    }
    return 0;
}



Measured memory_bytes: 15484