#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector <int> vec;
#define pb push_back
typedef pair <int, int> pii;
const int N = 2e5 + 5;
int siz[N], c[N], key[N]; vec son[N], p, ans;
void dfs(int u) {
	p. pb(u);
	for (int v : son[u]) dfs(v);
}
vec beechtree(int n, int m, vec fa, vec w) {
	for (int i=1; i<n; i++)
		son[fa[i]]. pb(i);
	for (int i=n-1; ~i; i--) {
		siz[i] = 1;
		for (int j : son[i]) siz[i] += siz[j];
	}
	for (int i=0; i<n; i++) {
		p. clear(), dfs(i), sort (p. begin(), p. end(), [] (const int &u, const int &v) { return siz[u] > siz[v]; });
		for (int j=0; j<siz[i]; ) {
			int k = j;
			while (k < siz[i] && siz[p[k]] == siz[p[j]])
				key[p[k]] = ! k ? 0 : key[fa[p[k]]], k ++;
			sort (p. begin() + j, p. begin() + k, [] (const int &u, const int &v) { return key[u] < key[v]; });
			for (; j<k; j++) key[p[j]] = j;
		} bool f = 1;
		for (int j : p) {
			if (j == i) continue;
			if (p[c[w[j]]] ^ fa[j]) { f = 0; break; }
			c[w[j]] ++;
		}
		for (int j : p) c[w[j]] = 0;
		ans. pb(f);
	}
	for (int i=1; i<n; i++)
		assert (! ans[fa[i]] || ans[i]);
	return ans;
}