#include <bits/stdc++.h>
using namespace std;
#define fo(v, a, b) for(int v = a; v <= b; v++)
#define fr(v, a, b) for(int v = a; v >= b; v--)
#define cl(a, v) memset(a, v, sizeof(a))

typedef long long ll;

const int N = 2e5 + 10;

int n, Q, f[N]; ll a[N], b[N];

int pos[N], cnt; priority_queue<pair<ll, int> > q; ll val[N];
void Solve() {
    cnt = 0, cl(val, 0);
    fo(i, 1, n) val[i] += a[i], val[f[i]] += b[i];
    fo(i, 1, n) q.push(make_pair(val[i], i));
    while(q.size()) {
        auto t = q.top(); int x = t.second; q.pop();
        if(val[x] != t.first) {  q.push(make_pair(val[x], x)); continue; }
        pos[x] = ++cnt, val[f[x]] -= b[x];
        // printf("%d ", x);
    }
    // puts("");
}

int main()
{
    scanf("%d%d", &n, &Q);
    fo(i, 2, n) scanf("%d", &f[i]);
    fo(i, 1, n) scanf("%d", &a[i]);
    fo(i, 1, n) scanf("%d", &b[i]);

    Solve();
    while(Q--) {
        int o, p, x, y; scanf("%d", &o);
        if(o == 1) {
            scanf("%d%d%d", &p, &x, &y);
            a[p] = x, b[p] = y, Solve();
        } else {
            scanf("%d%d", &x, &y);
            puts(pos[x] < pos[y] ? "0" : "1");
        }
    }

    return 0;
}