#include <bits/stdc++.h>
const int N = 200005;
int x, tg[N], mark[N], cov[N], tmp[N], edge, Next[N], opt[N];
int to[N], last[N], d[N], ct[N], black[N], n, Q, q[N];
std::vector<int> e[N];
void mem() {
  memset(last, 0, sizeof(last));
  memset(tg, 0, sizeof(tg));
  edge = 0;
  memset(cov, 0, sizeof(cov));
  memset(mark, 0, sizeof(mark));
  memcpy(tmp, black, sizeof(tmp));
}
void add(int x, int y, int dis, int cnt) {
  to[++edge] = y;
  Next[edge] = last[x];
  last[x] = edge;
  d[edge] = dis;
  ct[edge] = cnt;
}
void dfs_init(int x, int fa, int dis, int cnt) {
  if (mark[x] == 1) {
    if (fa) add(fa, x, dis, cnt);
    for (int u : e[x]) dfs_init(u, x, 0, 0);
  } else {
    dis++;
    if (!black[x]) cnt++;
    for (int u : e[x]) dfs_init(u, fa, dis, cnt);
  }
}
void col(int x) {
  if (!black[x]) {
    black[x] = 1;
    return;
  }
  tg[x]++;
  for (int i = last[x]; i; i = Next[i]) {
    int u = to[i];
    if (ct[i] < tg[x]) col(u);
  }
}
void clear(int x) {
  black[x] = tg[x] = 0;
  cov[x] = 1;
  for (int i = last[x]; i; i = Next[i]) {
    int u = to[i];
    ct[i] = d[i];
    clear(u);
  }
}
void dfs(int x, int y, int res, int tag) {
  if (mark[x]) {
    res = tg[x];
    tag |= cov[x];
  } else {
    black[x] = tmp[x];
    if (tag) black[x] = 0;
    if (res && !black[x]) {
      res--;
      black[x] = 1;
    }
  }
  for (int u : e[x]) dfs(u, x, res, tag);
}
int main() {
  scanf("%d%d", &n, &Q);
  for (int i = 2; i <= n; i++) {
    scanf("%d", &x);
    e[x].push_back(i);
  }
  for (int i = 1; i <= Q; i++) scanf("%d%d", &opt[i], &q[i]);
  int block = (int)sqrt(Q) + 1;
  for (int l = 1, r = block; l <= Q; l += block, r += block) {
    if (r > Q) r = Q;
    mem();
    for (int i = l; i <= r; i++) mark[q[i]] = 1;
    dfs_init(1, 0, 0, 0);
    for (int i = l; i <= r; i++) {
      if (opt[i] == 1)
        col(q[i]);
      else if (opt[i] == 2)
        clear(q[i]);
      else
        puts(black[q[i]] ? "black" : "white");
    }
    dfs(1, 0, 0, 0);
  }
}
