#include<bits/stdc++.h>
#define mk(x,y) make_pair(x,y)
#define Add(x,y) (x+y>=mod)?(x+y-mod):(x+y)
#define lowbit(x) x&(-x)
#define pi pair<ll,ll>
#define pii pair<ll,pair<ll,ll>>
#define iip pair<pair<ll,ll>,ll>
#define ppii pair<pair<ll,ll>,pair<ll,ll>>
#define fi first
#define se second
#define full(l,r,x) for(auto it=l;it!=r;it++) (*it)=x
#define Full(a) memset(a,0,sizeof(a))
#define open(s1,s2) freopen(s1,"r",stdin),freopen(s2,"w",stdout);
#define For(i,l,r) for(int i=l;i<=r;i++)
#define _For(i,l,r) for(int i=r;i>=l;i--)
using namespace std;
typedef double db;
typedef unsigned long long ull;
typedef long long ll;
bool Begin;
const ll N=2e5+10;
inline ll read(){
    ll x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-')
          f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline void write(ll x){
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x>9)
	  write(x/10);
	putchar(x%10+'0');
}
int c,n,q,op,id,x,y;
int a[N],b[N],fa[N];
ll sum[N];
vector<int> E[N];
inline void add(int u,int v){
	E[u].push_back(v);
	E[v].push_back(u);
}
namespace Sub1{
	int cnt=0;
	ll s=0;
	ll dp[N];
	pi t[N];
	inline void dfs(int u){
		for(auto v:E[u]){
			if(v==fa[u])
			  continue;
			dfs(v);
		}
		cnt=s=0;
		for(auto v:E[u]){
			if(v==fa[u])
			  continue;
			t[++cnt]={dp[v],v};
		}
		sort(t+1,t+cnt+1);
		reverse(t+1,t+cnt+1);
		For(i,1,cnt){
			if(a[u]+sum[u]>t[i].fi+s)
			  break;
			s+=b[t[i].se];
		}
		dp[u]+=sum[u]-s;
	}
	inline void solve(){
		For(i,1,n)
		  dp[i]=a[i];
		dfs(1);
	}
	inline void work(){
		while(q--){
			op=read();
			if(op==1){
				id=read(),x=read(),y=read();
				sum[fa[id]]-=b[id];
				a[id]=x,b[id]=y;
				sum[fa[id]]+=b[id];
			}
			else{
				x=read(),y=read();
				solve();
				if(mk(dp[x],x)>mk(dp[y],y))
				  puts("0");
				else
				  puts("1");
			}
		}
	}
};
namespace Sub2{
	int rt[N];
	ll dp[N];
	int cnt=0;
	stack<int> T;
	mt19937 R(time(0));
	struct Node{
		int L,R;
		ll sum;
		ll Min;
		int data;
		int siz;
		ll key;
		pi val;
		#define ls(k) X[k].L
		#define rs(k) X[k].R 
	}X[N];
	inline void pushup(int k){
		X[k].siz=X[ls(k)].siz+1ll+X[rs(k)].siz;
		X[k].sum=X[ls(k)].sum+X[k].data+X[rs(k)].sum;
		X[k].Min=X[k].val.fi+X[ls(k)].sum;
		if(ls(k))
		  X[k].Min=min(X[k].Min,X[ls(k)].Min);
		if(rs(k))
		  X[k].Min=min(X[k].Min,X[ls(k)].sum+X[k].data+X[rs(k)].Min);
	}
	inline int newnode(int x){
		int u;
		if(T.size()){
			u=T.top();
			T.pop();
		}
		else
		  u=++cnt;
		ls(u)=rs(u)=0;
		X[u].sum=X[u].data=b[x];
		X[u].val={dp[x],x};
		X[u].Min=dp[x];
		X[u].siz=1;
		X[u].key=R();
		return u;
	}
	inline void split(int k,pi v,int &x,int &y){
		if(!k){
			x=y=0;
			return ;
		}
		if(X[k].val>=v){
			x=k;
			split(rs(k),v,rs(k),y);
		}
		else{
			y=k;
			split(ls(k),v,x,ls(k));
		}
		pushup(k);
	}
	inline int merge(int x,int y){
		if(!x||!y)
		  return x+y;
		if(X[x].key<X[y].key){
			rs(x)=merge(rs(x),y);
			pushup(x);
			return x;
		}
		else{
			ls(y)=merge(x,ls(y));
			pushup(y);
			return y;
		}
	}
	inline void insert(int u,int v){
//		cerr<<v<<':'<<dp[v]<<'\n';
		int id=newnode(v),x,y;
		split(rt[u],X[id].val,x,y);
		rt[u]=merge(merge(x,id),y);
	}
	inline void del(int u,int v){
		int x,y,z;
		pi t={dp[v],v};
		split(rt[u],t,x,y);
		t.se++;
		split(x,t,x,z);
		T.push(z);
		rt[u]=merge(x,y);
	}
	inline ll Find(int k,ll v,ll pre){
		if(!k)
		  return 0;
		if(ls(k)&&v>X[ls(k)].Min+pre)
		  return Find(ls(k),v,pre);
		if(v>X[k].val.fi+X[ls(k)].sum+pre)
		  return X[ls(k)].sum;
		return Find(rs(k),v,pre+X[ls(k)].sum+X[k].data)+X[ls(k)].sum+X[k].data;
	}
	inline void dfs(int u){
		for(auto v:E[u]){
			if(v==fa[u])
			  continue;
			dfs(v);
			insert(u,v);
		}
		dp[u]+=sum[u]-Find(rt[u],a[u]+sum[u],0);
	}
	inline void work(){
		For(i,1,n)
		  dp[i]=a[i];
		dfs(1);
		while(q--){
			op=read();
//			cerr<<op<<'\n';
			if(op==1){
				id=read(),x=read(),y=read();
				sum[fa[id]]-=b[id];
				a[id]=x,b[id]=y;
				sum[fa[id]]+=b[id];
				while(id){
//					cerr<<id<<'\n';
					if(fa[id])
					  del(fa[id],id);
					dp[id]=a[id]+sum[id]-Find(rt[id],a[id]+sum[id],0);
					if(fa[id])
					  insert(fa[id],id);
					id=fa[id];
				}
			}
			else{
				x=read(),y=read();
				if(mk(dp[x],x)>mk(dp[y],y))
				  puts("0");
				else
				  puts("1");				
			}
		}
	}	
};
bool End;
int main(){
	//open("A.in","A.out");
	n=read(),q=read();
	For(i,2,n){
		fa[i]=read();
		add(fa[i],i);
	}
	For(i,1,n)
	  a[i]=read();
	For(i,1,n){
		b[i]=read();
		sum[fa[i]]+=b[i];
	}
	  Sub2::work();
	
	cerr<<'\n'<<abs(&Begin-&End)/1048576<<"MB";
	return 0;
}