//ANMHLIJKTJIY!
#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
#include "beechtree.h"
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define F first
#define S second
#define ll long long
#define N 200010
using namespace std;
ll n,col[N],app[N];
bool vis[N];
vector<ll> vt[N],sons[N];
void predfs(ll x)
{
	ll i,j;
	vis[x]=false;
	for(i=0;i<vt[x].size();i++)
	{
		predfs(vt[x][i]);
		vis[x]|=vis[vt[x][i]];
		sons[x].push_back(col[vt[x][i]]);
	}
	sort(sons[x].begin(),sons[x].end());
	for(i=1;i<sons[x].size();i++)
	{
		if(sons[x][i]==sons[x][i-1])
		{
			vis[x]=true;
			break;
		}
	}
	if(vis[x])
	{
		return;
	}
	for(i=0;i<vt[x].size();i++)
	{
		ll y=vt[x][i];
		for(j=0;j<sons[y].size();j++)
		{
			ll p=lower_bound(sons[x].begin(),sons[x].end(),sons[y][j])-sons[x].begin();
			if(p>=sons[x].size()||sons[x][p]!=sons[y][j])
			{
				vis[x]=true;
				break;
			}
		}
		if(vis[x])
		{
			return;
		}
	}
	return;
}
vector<ll> seq;
void dfs(ll x)
{
	ll i;
	seq.push_back(x);
	for(i=0;i<vt[x].size();i++)
	{
		dfs(vt[x][i]);
	}
	return;
}
bool cmp(ll x,ll y)
{
	return sons[x].size()>sons[y].size();
}
bool check(ll x)
{
	ll i,j;
	seq.clear();
	dfs(x);
	sort(seq.begin(),seq.end(),cmp);
	for(i=0;i<seq.size();i++)
	{
		app[col[seq[i]]]=0;
	}
	for(i=0;i<seq.size();i++)
	{
		for(j=0;j<sons[seq[i]].size();j++)
		{
			if(app[sons[seq[i]][j]]!=i)
			{
				return false;
			}
			app[sons[seq[i]][j]]++;
		}
	}
	return true;
}
vector<int> beechtree(int _n,int _m,vector<int> _p,vector<int> _c)
{
	ll i;
	n=_n;
	for(i=1;i<n;i++)
	{
		vt[_p[i]].push_back(i);
	}
	for(i=0;i<n;i++)
	{
		col[i]=_c[i];
	}
	predfs(0);
	vector<int> ans(n,0);
	for(i=0;i<n;i++)
	{
		if(!vis[i])
		{
			if(check(i))
			{
				ans[i]=1;
			}
		}
	}
	return ans;
}