#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];
vector<int> son[N];

pair<ll, int> res[N];
priority_queue<pair<ll, int> > q; ll val[N];
void Solve() {
    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; }
        res[x] = make_pair(val[x], x), val[f[x]] -= b[x];
    }
}

void update(int x) {
    pair<ll, int> cur = make_pair(a[x], x);
    vector<pair<pair<ll, int>, int> > vec;
    for(int y : son[x])
        vec.push_back(make_pair(res[y], b[y])), cur.first += b[y];
    sort(vec.begin(), vec.end(), greater<pair<pair<ll, int>, int>>());
    for(int i = 0; i < (int)vec.size(); i++) {
        if(vec[i].first < cur) return res[x] = cur, void();
        cur.first -= vec[i].second;
    }
    res[x] = cur;
}

int main()
{
    scanf("%d%d", &n, &Q);
    fo(i, 2, n) scanf("%d", &f[i]), son[f[i]].push_back(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; for(; p; p = f[p]) update(p);
        } else {
            scanf("%d%d", &x, &y);
            puts(res[x] > res[y] ? "0" : "1");
        }
    }

    return 0;
}