/*
 * @Author: qL
 * @Date: 2024-11-24 19:13:43
 * @LastEditTime: 2024-11-25 08:10:57
 * @Problem: CTS2024 投票游戏
 * @Link: https://www.luogu.com.cn/problem/P10214
 * @Solution: Official
 */
#include <cstdio>
#include <vector>
#include <random>
#include <chrono>
#include <algorithm>
using i32 = int;
using i64 = long long;
constexpr i32 N = 2E5;
i32 n, q, fa[N + 1];
std::vector<i32> G[N + 1];
struct Input {
	i32 a, b;
} dat[N + 1];
class Treap {
	using val_t = std::pair<i64, i32>;
	static inline std::mt19937 Rnd{std::random_device{}() + std::chrono::steady_clock::now().time_since_epoch().count()};
	static inline struct node {
		i32 pri;
		i32 ls, rs;
		val_t val;
		i32 w;
		i64 sum, mn;
	} tr[N + 1];
	static inline i32 tot, sta[N + 1], top;
	static i32 Create(val_t val) noexcept {
		i32 p = top ? sta[top--] : ++tot;
		return tr[p] = {i32(Rnd()), 0, 0, val, dat[val.second].b, dat[val.second].b, val.first}, p;
	}
	static void Recycle(i32 p) noexcept { sta[++top] = p; }
	static void pull(i32 p) noexcept {
		tr[p].sum = tr[tr[p].ls].sum + tr[p].w + tr[tr[p].rs].sum;
		tr[p].mn = tr[tr[p].ls].sum + tr[p].val.first;
		if (tr[p].ls) tr[p].mn = std::min(tr[p].mn, tr[tr[p].ls].mn);
		if (tr[p].rs) tr[p].mn = std::min(tr[p].mn, tr[tr[p].ls].sum + tr[p].w + tr[tr[p].rs].mn);
	}
	static void split(i32 p, val_t val, i32& x, i32& y) noexcept {
		if (!p) return void(x = y = 0);
		tr[p].val >= val ? split(tr[p].rs, val, tr[x = p].rs, y) : split(tr[p].ls, val, x, tr[y = p].ls);
		pull(p);
	}
	static i32 merge(i32 x, i32 y) noexcept {
		if (!x || !y) return x | y;
		if (tr[x].pri < tr[y].pri)
			return tr[x].rs = merge(tr[x].rs, y), pull(x), x;
		else
			return tr[y].ls = merge(x, tr[y].ls), pull(y), y;
	}
	static i64 query(i32 p, i64 lim) noexcept {
		if (!p) return 0;
		if (tr[p].ls && lim > tr[tr[p].ls].mn) return query(tr[p].ls, lim);
		if (lim > tr[p].val.first + tr[tr[p].ls].sum) return tr[tr[p].ls].sum;
		return query(tr[p].rs, lim - tr[tr[p].ls].sum - tr[p].w) + tr[tr[p].ls].sum + tr[p].w;
	}
	i32 rt;

   public:
	void insert(val_t val) noexcept {
		static i32 x, y;
		split(rt, val, x, y);
		rt = merge(merge(x, Create(val)), y);
	}
	void erase(val_t val) noexcept {
		static i32 x, y, z;
		split(rt, val, x, z);
		split(x, {val.first, val.second + 1}, x, y);
		Recycle(y), rt = merge(x, z);
	}
	i64 query(i64 lim) noexcept { return query(rt, lim); }
} bst[N + 1];
i64 sum[N + 1], f[N + 1];
void dfs(i32 u) noexcept {
	if (G[u].empty()) return void(f[u] = dat[u].a);
	for (i32 v : G[u]) dfs(v), bst[u].insert({f[v], v});
	f[u] = dat[u].a + sum[u] - bst[u].query(dat[u].a + sum[u]);
}
signed main() noexcept {
	scanf("%d%d", &n, &q);
	for (i32 i = 2; i <= n; ++i) scanf("%d", &fa[i]), G[fa[i]].emplace_back(i);
	for (i32 i = 1; i <= n; ++i) scanf("%d", &dat[i].a);
	for (i32 i = 1; i <= n; ++i) scanf("%d", &dat[i].b), sum[fa[i]] += dat[i].b;
	dfs(1);
	for (i32 op, x, y; q; --q)
		if (scanf("%d", &op), op == 1) {
			scanf("%d%d%d", &op, &x, &y);
			sum[fa[op]] -= dat[op].b, dat[op] = {x, y}, sum[fa[op]] += dat[op].b;
			for (; op; op = fa[op]) {
				if (fa[op]) bst[fa[op]].erase({f[op], op});
				f[op] = dat[op].a + sum[op] - bst[op].query(dat[op].a + sum[op]);
				if (fa[op]) bst[fa[op]].insert({f[op], op});
			}
		} else {
			scanf("%d%d", &x, &y);
			putchar("01"[std::make_pair(f[x], x) < std::make_pair(f[y], y)]), putchar('\n');
		}
	return 0;
}