//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);}
#define kill apiad
int p[200200];
ll a[200200],b[200200];
ll tmp[200200];
int kill[200200];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,q;
	cin>>n>>q;
	for(int i=2;i<=n;i++)
		cin>>p[i];
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=n;i++)
		cin>>b[i];
	while(q--)
	{
		int op;
		cin>>op;
		if(op==1)
		{
			int x,y,z;
			cin>>x>>y>>z;
			a[x]=y;
			b[x]=z;
		}
		else
		{
			int c,d;
			cin>>c>>d;
			memset(tmp,0,sizeof(ll)*(n+5));
			memset(kill,0,sizeof(int)*(n+5));
			for(int i=1;i<=n;i++)
				tmp[i]=a[i];
			for(int i=2;i<=n;i++)
				tmp[p[i]]+=b[i];
			priority_queue<pair<ll,int>> pq;
			for(int i=1;i<=n;i++)
				pq.emplace(tmp[i],i);
			int ans=0;
			while(!pq.empty())
			{
				ll V=pq.top().first;
				int u=pq.top().second;
				pq.pop();
				if(tmp[u]!=V||kill[u]) continue;
				if(u==c)
					break;
				if(u==d)
				{
					ans=1;
					break;
				}
				kill[u]=1;
				if(p[u]&&!kill[p[u]])
				{
					tmp[p[u]]-=b[u];
					pq.emplace(tmp[p[u]],p[u]);
				}
			}
			cout<<ans<<'\n';
		}
	}
	return 0;
}