#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll LIM=2e5+7;
vector<int>V[LIM];
ll A[LIM], B[LIM], oc[LIM], dp[LIM];
void licz(int x) {
	dp[x]=A[x];
	for(auto i : V[x]) dp[x]+=B[i];
	vector<pair<ll,ll>>P;
	for(auto i : V[x]) P.pb({dp[i], B[i]});
	sort(all(P));
	reverse(all(P));
	for(auto i : P) if(i.st>dp[x]) {
		dp[x]-=i.nd;
	}
}
void DFS(int x) {
	for(auto i : V[x]) DFS(i);
	licz(x);
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, q;
	cin >> n >> q;
	rep(i, n-1) {
		int x;
		cin >> x; --x;
		oc[i+1]=x;
		V[x].pb(i+1);
	}
	rep(i, n) {
		cin >> A[i];
		A[i]=A[i]*LIM+i;
	}
	rep(i, n) {
		cin >> B[i];
		B[i]*=LIM;
	}
	DFS(0);
	while(q--) {
		int t;
		cin >> t;
		if(t==1) {
			ll p, x, y;
			cin >> p >> x >> y; --p;
			x*=LIM; y*=LIM; x+=p;
			A[p]=x; B[p]=y;
			licz(p);
			while(p) {
				p=oc[p];
				licz(p);
			}
		} else {
			ll a, b;
			cin >> a >> b; --a; --b;
			cout << (dp[a]>dp[b]?0:1) << '\n';
		}
	}
}