// Problem: P10214 [CTS2024] 投票游戏
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P10214
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define eb emplace_back
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
bool Mbe;

mt19937 rnd(114514);
const int N = 2e5 + 5;
const ll inf = 1e18;

int n, q, dfc, a[N], b[N];
int fa[N], son[N], sz[N], dep[N], top[N], bot[N], id[N];
ll s[N], f[N];

vector<int> g[N];

struct Treap {
	int rt[N];
	struct S { 
		int lc, rc, id; 
		ll s, m; 
	} t[N];
	#define ls(x) t[x].lc
	#define rs(x) t[x].rc
	void pup(int x) {
		t[x].s = t[ls(x)].s + t[rs(x)].s + b[x];
		t[x].m = min(t[ls(x)].m, min(t[ls(x)].s + f[x], t[ls(x)].s + b[x] + t[rs(x)].m));
	}
	void spl(int p, ll k, int q, int &x, int &y) {
		if (!p) return x = y = 0, void();
		if (f[p] > k || (f[p] == k && p > q)) x = p, spl(rs(x), k, q, rs(x), y), pup(x);
		else y = p, spl(ls(y), k, q, x, ls(y)), pup(y);
	}
	int mrg(int x, int y) {
		if (!x || !y) return x | y;
		if (t[x].id < t[y].id) return rs(x) = mrg(rs(x), y), pup(x), x;
		else return ls(y) = mrg(x, ls(y)), pup(y), y;
	}
	ll qry(int p, ll k) {
		if (!p) return k;
		if (t[ls(p)].m < k) return qry(ls(p), k);
		if (t[ls(p)].s + f[p] < k) return k - t[ls(p)].s;
		return qry(rs(p), k - t[ls(p)].s - b[p]);
	}
	ll q(int v, ll k) { return qry(rt[v], k); }
	void i(int v) {
		if (v == 1) return;
		int u = fa[v], x, y; x = y = 0;
		spl(rt[u], f[v], v, x, y);
		t[v].m = f[v], t[v].s = b[v];
		rt[u] = mrg(x, mrg(v, y));
	}
	void e(int v) {
		if (v == 1) return;
		int u = fa[v], x, y, z; x = y = z = 0;
		spl(rt[u], f[v], v, x, y);
		spl(y, f[v], v - 1, y, z);
		rt[u] = mrg(x, z);
	}
	#undef ls
	#undef rs
} T1;

struct S {
	ll k, x, y;
	S () { }
	S (ll _k, ll _x, ll _y) :
	 	k(_k), x(_x), y(_y) { }
	ll q(ll p) { return p < k ? x : y; }
	S operator + (S rh) const { return S(k, rh.q(x), rh.q(y)); }
};

struct SEG {
	S t[N << 2];
	#define ls x << 1
	#define rs x << 1 | 1
	#define m ((l + r) >> 1)
	void pup(int x) { t[x] = t[rs] + t[ls]; }
	void upd(int l, int r, int p, S c, int x) {
		if (l == r) return t[x] = c, void();
		if (p <= m) upd(l, m, p, c, ls);
		else upd(m + 1, r, p, c, rs);
		pup(x);
	}
	S qry(int l, int r, int L, int R, int x) {
		if (L <= l && r <= R) return t[x];
		if (L > m) return qry(m + 1, r, L, R, rs);
		if (R <= m) return qry(l, m, L, R, ls);
		return qry(m + 1, r, L, R, rs) + qry(l, m, L, R, ls);
	}
	void u(int p, S c) { upd(1, n, p, c, 1); }
	S q(int l, int r) { return qry(1, n, l, r, 1); }
	#undef ls
	#undef rs
	#undef m
} T2;

S qg(int u) {
	if (!g[u].size()) return S(0, 0, a[u]);
	ll lim = T1.q(u, a[u] + s[u]);
	return S(lim, lim, T1.q(u, a[u] + s[u] - b[son[u]]));
}

ll qf(int u) {
	return T2.q(id[u], id[bot[u]]).q(0);
}

void dfs1(int u) {
	sz[u] = 1, dep[u] = dep[fa[u]] + 1;
	for (int v : g[u]) {
		dfs1(v), sz[u] += sz[v], s[u] += b[v];
		if (sz[v] > sz[son[u]]) son[u] = v;
	}
	for (int v : g[u])
		if (v != son[u]) T1.i(v);
	f[u] = qg(u).q(f[son[u]]);
}

void dfs2(int u, int pr) {
	top[u] = pr, id[u] = ++dfc, T2.u(id[u], qg(u));
	if (!g[u].size()) return bot[u] = u, void();
	dfs2(son[u], pr), bot[u] = bot[son[u]];
	for (int v : g[u]) if (v != son[u]) dfs2(v, v);
}

void upd(int u) {
	while (top[u]) {
		T2.u(id[u], qg(u));
		T1.e(top[u]), f[top[u]] = qf(top[u]), T1.i(top[u]);
		u = fa[top[u]];
	}
}

void solve() {
	cin >> n >> q;
	for (int i = 2; i <= n; i++)
		cin >> fa[i], g[fa[i]].eb(i);
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) cin >> b[i];
	for (int i = 1; i <= n; i++) T1.t[i].id = rnd();
	T1.t[0].m = inf;
	dfs1(1), dfs2(1, 1);
	while (q--) {
		int op, u, x, y; cin >> op;
		if (op == 1) {
			cin >> u >> x >> y;
			a[u] = x, upd(u);
			if (u == 1) continue;
			s[fa[u]] += y - b[u], b[u] = y;
			if (u != son[fa[u]]) T1.e(u), f[u] = qf(u), T1.i(u);
			upd(fa[u]);
		} else {
			cin >> x >> y;
			ll fx = qf(x), fy = qf(y);
			if (fx > fy || (fx == fy && x > y)) cout << 0 << '\n';
			else cout << 1 << '\n';
		}
	}
}

bool Med;
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	#ifdef FILE
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}