/* -*- coding: utf-8 -*-
 *
 * 1790.cc:  No.1790 Subtree Deletion - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef long long ll;
typedef pair<int,ll> pil;
typedef vector<pil> vpil;

template <typename T>
struct SegTreeDelay {
  int e2;
  vector<T> nodes;
  T defv;
  vector<bool> dls;
  SegTreeDelay() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
    dls.assign(e2 * 2, false);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = nodes[j * 2 + 1] ^ nodes[j * 2 + 2];
  }

  void __update(int k) {
    if (dls[k]) {
      int k0 = k * 2 + 1, k1 = k0 + 1;
      nodes[k0] = nodes[k1] = nodes[k];
      dls[k0] = dls[k1] = true;
      dls[k] = false;
    }
  }

  void set_range(int r0, int r1, T v, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      nodes[k] = v;
      dls[k] = true;
      return;
    }

    __update(k);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    set_range(r0, r1, v, k0, i0, im);
    set_range(r0, r1, v, k1, im, i1);
    nodes[k] = nodes[k0] ^ nodes[k1];
  }
  void set_range(int r0, int r1, T v) { set_range(r0, r1, v, 0, 0, e2); }

  T xor_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    __update(k);

    int im = (i0 + i1) / 2;
    T v0 = xor_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = xor_range(r0, r1, k * 2 + 2, im, i1);
    return v0 ^ v1;
  }
  T xor_range(int r0, int r1) { return xor_range(r0, r1, 0, 0, e2); }
};

/* global variables */

vpil nbrs[MAX_N];
int ps[MAX_N], cis[MAX_N], ls[MAX_N], rs[MAX_N];
ll pes[MAX_N];
SegTreeDelay<ll> st;

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 1; i < n; i++) {
    int u, v;
    ll a;
    scanf("%d%d%lld", &u, &v, &a);
    u--, v--;
    nbrs[u].push_back(pil(v, a));
    nbrs[v].push_back(pil(u, a));
  }

  ps[0] = -1, pes[0] = 0;
  for (int u = 0, k = 0; u >= 0;) {
    vpil &nbru = nbrs[u];
    int up = ps[u];

    if (cis[u] == 0) ls[u] = k++;
    if (cis[u] < nbru.size()) {
      pil ve = nbru[cis[u]++];
      int v = ve.first;
      if (v != up) {
	ps[v] = u, pes[v] = ve.second;
	u = v;
      }
    }
    else {
      rs[u] = k;
      u = up;
    }
  }

  st.init(n, 0);
  for (int i = 0; i < n; i++) st.seti(ls[i], pes[i]);
  st.setall();

  int qn;
  scanf("%d", &qn);

  while (qn--) {
    int ti, xi;
    scanf("%d%d", &ti, &xi), xi--;

    if (ti == 1)
      st.set_range(ls[xi], rs[xi], 0);
    else {
      ll v = st.xor_range(ls[xi] + 1, rs[xi]);
      printf("%lld\n", v);
    }
  }
  return 0;
}