//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
mt19937_64 rng(20210448);
int n,q;
vector<int> G[200200];
int siz[200200],son[200200],in[200200],out[200200],dfn,tp[200200],low[200200],p[200200];
void dfs(int u)
{
	siz[u]=1;
	for(auto v:G[u])
	{
		dfs(v);
		if(siz[v]>siz[son[u]])
			son[u]=v;
		siz[u]+=siz[v];
	}
}
void dfs2(int u)
{
	in[u]=++dfn;
	if(!tp[u]) tp[u]=u;
	low[tp[u]]=u;
	if(son[u])
	{
		tp[son[u]]=tp[u];
		dfs2(son[u]);
	}
	for(auto v:G[u])
		if(v!=son[u])
			dfs2(v);
	out[u]=dfn;
}
ll a[200200],b[200200],f[200200],sta[200200];
int ls[200200],rs[200200];
ll sb[200200],lim[200200];
ull prior[200200];
void pushup(int x)
{
	sb[x]=b[x]+sb[ls[x]]+sb[rs[x]];
	lim[x]=min({rs[x]?lim[rs[x]]:1ll*inf*inf,f[x]+1+sb[rs[x]],ls[x]?(lim[ls[x]]+b[x]+sb[rs[x]]):1ll*inf*inf});
}
ll query(int x,ll f)
{
	if(rs[x]&&lim[rs[x]]<=f)
		return query(rs[x],f);
	if(f>::f[x]+sb[rs[x]])
		return f-sb[rs[x]];
	if(!ls[x]) return f-sb[rs[x]]-b[x];
	return query(ls[x],f-sb[rs[x]]-b[x]);
}
int merge(int x,int y)
{
	if(!x||!y) return x+y;
	if(prior[x]>prior[y])
	{
		rs[x]=merge(rs[x],y);
		pushup(x);
		return x;
	}
	else
	{
		if(ls[y]==171&&y==171)
			assert(false);
		ls[y]=merge(x,ls[y]);
		if(ls[y]==171&&y==171)
			assert(0);
		pushup(y);
		return y;
	}
}
void split(int x,ll v,int nd,int &a,int &b)
{
	if(!x)
	{
		a=b=0;
		return ;
	}
	if(f[x]<v||(f[x]==v&&x<nd))
	{
		a=x;
		split(rs[x],v,nd,rs[a],b);
		pushup(a);
	}
	else
	{
		b=x;
		split(ls[x],v,nd,a,ls[b]);
		pushup(b);
	}
}
struct info_t
{
	ll Lim,A,B;
	info_t(){}
	info_t(ll _Lim,ll _A,ll _B):Lim(_Lim),A(_A),B(_B){}
	const inline friend info_t operator +(const info_t &a,const info_t &b)
	{
		return info_t(b.Lim,b.A>=a.Lim?a.B:a.A,b.B>=a.Lim?a.B:a.A);
	}
	inline ll get(ll x){return x>=Lim?B:A;}
};
info_t segt[200200<<2];
#define ls (x<<1)
#define rs (ls|1)
void update(int x,int l,int r,int p,info_t info)
{
	if(l==r)
	{
		segt[x]=info;
		return ;
	}
	int mid=(l+r)/2;
	if(p<=mid)
		update(ls,l,mid,p,info);
	else
		update(rs,mid+1,r,p,info);
	segt[x]=segt[ls]+segt[rs];
}
ll query(int x,int l,int r,int ql,int qr,ll v)
{
	if(l==ql&&r==qr)
		return segt[x].get(v);
	int mid=(l+r)/2;
	if(qr<=mid)
		return query(ls,l,mid,ql,qr,v);
	if(ql>mid)
		return query(rs,mid+1,r,ql,qr,v);
	return query(ls,l,mid,ql,mid,query(rs,mid+1,r,mid+1,qr,v));
}
#undef ls
#undef rs
int rt[200200];
void dfs3(int u)
{
	sta[u]=a[u];
	for(auto v:G[u])
	{
		dfs3(v);
		if(v!=son[u])
		{
			sta[u]+=b[v];
			sb[v]=b[v];
			lim[v]=f[v]+1;
			int A,B;
			split(rt[u],f[v],v,A,B);
			rt[u]=merge(A,merge(v,B));
		}
	}
	if(!son[u])
	{
		f[u]=a[u];
		update(1,1,n,in[u],info_t(0,a[u],a[u]));
		return ;
	}
	ll f1=query(rt[u],sta[u]);
	ll f2=query(rt[u],sta[u]+b[son[u]]);
	update(1,1,n,in[u],info_t(f2,f2,f1));
	f[u]=(f[son[u]]>=f2?f1:f2);
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>q;
	for(int i=2;i<=n;i++)
	{
		cin>>p[i];
		G[p[i]].pb(i);
	}
	for(int i=1;i<=n;i++)
		prior[i]=rng();
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=n;i++)
		cin>>b[i];
	dfs(1);
	dfs2(1);
	dfs3(1);
	while(q--)
	{
		int op;
		cin>>op;
		if(op==1)
		{
			int x,y,z;
			cin>>x>>y>>z;
			sta[x]-=a[x]-y;
			a[x]=y;
			if(x==tp[x]&&p[x])
			{
				int A,B,C;
				split(rt[p[x]],f[x],x,A,B);
				split(B,f[x],x+1,B,C);
				rt[p[x]]=merge(A,C);
			}
			if(!son[x])
			{
				f[x]=a[x];
				update(1,1,n,in[x],info_t(0,a[x],a[x]));
			}
			else
			{
				ll f1=query(rt[x],sta[x]);
				ll f2=query(rt[x],sta[x]+b[son[x]]);
				update(1,1,n,in[x],info_t(f2,f2,f1));
				f[x]=query(1,1,n,in[x],in[low[tp[x]]],0);
			}
			if(x!=tp[x])
			{
				b[x]=z;
				int x2=p[x];
				if(x2==tp[x2]&&p[x2])
				{
					int A,B,C;
					split(rt[p[x2]],f[x2],x2,A,B);
					split(B,f[x2],x2+1,B,C);
					rt[p[x2]]=merge(A,C);
				}
				ll f1=query(rt[x2],sta[x2]);
				ll f2=query(rt[x2],sta[x2]+b[x]);
				update(1,1,n,in[x2],info_t(f2,f2,f1));
				f[x2]=(f[x]>=f2?f1:f2);
				if(x2==tp[x2]&&p[x2])
				{
					int A,B;
					split(rt[p[x2]],f[x2],x2,A,B);
					rt[p[x2]]=merge(A,merge(x2,B));
				}
			}
			int xx=x;
			while(x)
			{
				int y=tp[x];
				if(p[y])
				{
					int A,B,C;
					split(rt[p[y]],f[y],y,A,B);
					split(B,f[y],y+1,B,C);
					rt[p[y]]=merge(A,C);
				}
				f[y]=query(1,1,n,in[y],in[low[y]],0);
				if(!p[y]) break;
				if(y==xx)
				{
					sta[p[y]]-=b[y]-z;
					b[y]=z;
					sb[y]=z;
					lim[y]=f[y]+1;
				}
				int A,B;
				split(rt[p[y]],f[y],y,A,B);
				rt[p[y]]=merge(A,merge(y,B));
				x=p[y];
				ll f1=query(rt[x],sta[x]);
				ll f2=query(rt[x],sta[x]+b[son[x]]);
				update(1,1,n,in[x],info_t(f2,f2,f1));
			}
		}
		else
		{
			int c,d;
			cin>>c>>d;
			ll fc=query(1,1,n,in[c],in[low[tp[c]]],0);
			ll fd=query(1,1,n,in[d],in[low[tp[d]]],0);
			if(mp(fc,c)>mp(fd,d))
				cout<<"0\n";
			else
				cout<<"1\n";
		}
	}
	return 0;
}