#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);

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];

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];
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> 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);
  while (q--) {
    int op, x, y;
    cin >> op >> x;
    if (op == 1) {
      cin >> a[x] >> b[x];
    } else {
      cin >> y;
      solve(1);
      cout << (pll(f[x], x) > pll(f[y], y) ? 0 : 1) << '\n';
    }
  }
}