#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=N*4+5,K=1e7+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,q,fa[N],A[N],B[N];
vector<int> S[N];
int d[N],tp[N],ed[N],siz[N],son[N],id[N],ih;
void dfs1(int x,int La){
	d[x]=d[La]+1;siz[x]=1;
	for(int i:S[x]) dfs1(i,x),siz[x]+=siz[i],siz[i]>siz[son[x]]&&(son[x]=i);
}
void dfs2(int x,int La){
	tp[x]=La;id[x]=++ih;ed[tp[x]]=ih;if(son[x]) dfs2(son[x],La);
	for(int i:S[x]) if(i^son[x]) dfs2(i,i);
}
struct DS1{
	map<ll,ll> f;
	void add(ll x,ll y){f[x]+=y;}
	ll qry(ll x){
		ll ti=INF;x=INF-x;
		for(auto it=f.rbegin();it!=f.rend();it++){
			if(x<ti-it->fi) return ti-x;
			x+=it->se-(ti-it->fi);ti=it->fi;
		}
		gdb(x,ti);
		assert(0);
	}
}f1[N];
struct node{
	ll x,A,B;
	ll calc(ll y)const{return y<x?A:B;}
};
node operator +(const node &A,const node &B){
	return (node){A.x,B.calc(A.A),B.calc(A.B)};
}
namespace DS2{
	#define ls v<<1
	#define rs v<<1|1
	node f[M];
	void up(int v){f[v]=f[rs]+f[ls];}
	void modify(int x,node y,int l=1,int r=n,int v=1){
		if(l==r){f[v]=y;return;}int m=l+r>>1;
		x<=m?modify(x,y,l,m,ls):modify(x,y,m+1,r,rs);up(v);
	}
	node qry(int x,int y,int l=1,int r=n,int v=1){
		if(x<=l&&r<=y) return f[v];int m=l+r>>1;
		if(y<=m) return qry(x,y,l,m,ls);
		if(x>m) return qry(x,y,m+1,r,rs);
		return qry(x,y,m+1,r,rs)+qry(x,y,l,m,ls);
	}
	#undef ls
	#undef rs
}
ll dp[N],sum[N];
ll qry(int x){
	return DS2::qry(id[x],ed[tp[x]]).A;
}
void remake(int x){
	ll w=f1[x].qry(sum[x]);
	if(!son[x]){
		DS2::modify(id[x],(node){INF,w,0});
	}else{
		f1[x].add(w,B[son[x]]);
		DS2::modify(id[x],(node){w,w,f1[x].qry(sum[x])});
		f1[x].add(w,-B[son[x]]);
	}
}
void make(int x,int La){
	f1[x].add(-1,0);sum[x]=A[x];
	for(int i:S[x]){
		make(i,x);
		if(i^son[x]) f1[x].add(dp[i],B[i]);
		sum[x]+=B[i];
	}
	remake(x);
	dp[x]=qry(x);
	gdb(x,dp[x]);
}
void modify(int p,int x,int y){
	sum[p]-=A[p];A[p]=x;sum[p]+=A[p];
	remake(p);
	if(p^1){
		sum[fa[p]]-=B[p];
		if(tp[p]==p){
			f1[fa[p]].add(dp[p],-B[p]);
		}
	}
	B[p]=y;
	dp[p]=qry(p);
	if(p^1){
		sum[fa[p]]+=B[p];
		if(tp[p]==p){
			f1[fa[p]].add(dp[p],B[p]);
		}
	}
	if(p==1) return;
	p=fa[p];remake(p);
	while(p){
		p=tp[p];
		if(p^1) f1[fa[p]].add(dp[p],-B[p]),
		dp[p]=qry(p);
		if(p^1) f1[fa[p]].add(dp[p],B[p]),remake(fa[p]);
		p=fa[p];
	}
}
void Solve(){
	scanf("%d%d",&n,&q);
	for(int i=2;i<=n;i++) scanf("%d",&fa[i]),S[fa[i]].push_back(i);
	dfs1(1,0);
	dfs2(1,1);
	for(int i=1;i<=n;i++) scanf("%d",&A[i]);
	for(int i=1;i<=n;i++) scanf("%d",&B[i]);
	make(1,0);
	while(q--){
		int op,p,x,y;
		scanf("%d",&op);
		if(op==1) scanf("%d%d%d",&p,&x,&y),modify(p,x,y);
		else{
			scanf("%d%d",&x,&y);
			printf("%d\n",make_pair(qry(x),x)<make_pair(qry(y),y));
		}
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}