#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 200010;
const int maxm = maxn * 4;
mt19937 rnd(1145141);

struct node {
  ll sumb, mn;
  node() { sumb = mn = 0; }
  node(ll f, ll b) { sumb = b, mn = f; }
  friend node operator+(node x, node y) {
    node res;
    res.sumb = x.sumb + y.sumb;
    res.mn = min(x.mn, x.sumb + y.mn);
    return res;
  }
} sum[maxm], val[maxm];

int sid, n, q, fa[maxn], rt[maxn], ls[maxm], rs[maxm], kval[maxm], tot;
ll a[maxn], b[maxn], f[maxn], bsum[maxn], g[maxn];
pll t[maxm];
vector<int> e[maxn];

int nnd(ll f, ll b, int x) {
  t[++tot] = pll(f, x), sum[tot] = val[tot] = node(f, b);
  return kval[tot] = rnd(), tot;
}

void pushup(int x) {
  sum[x] = val[x];
  if (ls[x]) sum[x] = sum[ls[x]] + sum[x];
  if (rs[x]) sum[x] = sum[x] + sum[rs[x]];
}

int merge(int x, int y) {
  if (!x || !y) return x ^ y;
  if (kval[x] < kval[y]) return rs[x] = merge(rs[x], y), pushup(x), x;
  else return ls[y] = merge(x, ls[y]), pushup(y), y;
}

void split(int x, pll v, int &p, int &q) {
  if (!x) return p = q = 0, void();
  if (t[x] >= v) p = x, split(rs[x], v, rs[p], q);
  else q = x, split(ls[x], v, p, ls[q]);
  pushup(x);
}

ll find(int x, ll lim) {
  if (ls[x] && sum[ls[x]].mn < lim) return find(ls[x], lim);
  if (sum[ls[x]].sumb + val[x].mn < lim) return sum[ls[x]].sumb;
  return sum[ls[x]].sumb + val[x].sumb + find(rs[x], lim - sum[ls[x]].sumb - val[x].sumb);
}

void show(int x) {
  if (!x) return;
  show(ls[x]);
  cerr << "(" << val[x].sumb << "," << val[x].mn << ") ";
  show(rs[x]);
}

void ins(int &rt, ll f, ll b, ll x) {
  int p, q;
  split(rt, pll(f, b), p, q);
  rt = merge(merge(p, nnd(f, b, x)), q);
}

void del(int &rt, ll f, ll b, ll x) {
  int p, w, q;
  split(rt, pll(f, x), p, q), split(p, pll(f, x + 1), p, w);
  rt = merge(p, q);
}

void solve(int u) {
  vector<pll> vec;
  ll sum = 0;
  for (int v : e[u]) {
    solve(v), sum += b[v];
    vec.emplace_back(f[v], v);
  }
  // 按照 f[v] 排序之后第一个 a[u] + sum - sumb[i - 1] > f[i] 的位置
  // 也就是 a[u] + sum > f[i] + sumb[i - 1]
  sort(ALL(vec), greater<>());
  rep (i, 0, SZ(vec) - 1) {
    if (a[u] + sum > vec[i].fi) return f[u] = a[u] + sum, void();
    sum -= b[vec[i].se];
  }
  f[u] = a[u];
}

void calc(int u) {
  if (sum[rt[u]].mn >= a[u] + bsum[u]) return f[u] = a[u], void();
  ll res = find(rt[u], a[u] + bsum[u]);
  f[u] = a[u] + bsum[u] - res;
}

void dfs(int u) {
  for (int v : e[u]) {
    dfs(v), ins(rt[u], f[v], b[v], v);
  }
  calc(u);
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> sid >> n >> q;
  rep (i, 2, n) cin >> fa[i];
  rep (i, 2, n) e[fa[i]].emplace_back(i);
  rep (i, 1, n) cin >> a[i];
  rep (i, 1, n) cin >> b[i], bsum[fa[i]] += b[i];
  solve(1);
  rep (i, 1, n) g[i] = f[i];
  dfs(1);
  // rep (i, 1, n) cerr << f[i] << " \n"[i == n];
  // rep (i, 1, n) assert(f[i] == g[i]);
  while (q--) {
    int op, x, y;
    cin >> op >> x;
    if (op == 1) {
      int p = x;
      while (fa[p]) {
        del(rt[fa[p]], f[p], b[p], p);
        p = fa[p];
      }
      bsum[fa[x]] -= b[x];
      cin >> a[x] >> b[x];
      bsum[fa[x]] += b[x];
      while (x) {
        calc(x);
        if (fa[x]) ins(rt[fa[x]], f[x], b[x], x);
        x = fa[x];
      }
    } else {
      cin >> y;
      solve(1);
      cout << (pll(f[x], x) > pll(f[y], y) ? 0 : 1) << '\n';
    }
  }
}