// clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w)
#ifndef ONLINE_JUDGE
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 };
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T> inline V<T> vec(size_t a) { return V<T>(a); }
template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T> inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T> inline constexpr const T cumsum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r]
template<class T> inline constexpr const T min(const V<T>& v) { return *min_element(all(v)); }
template<class T> inline constexpr const T max(const V<T>& v) { return *max_element(all(v)); }
// clang-format on

template <class T> class BinaryIndexedTree {
    int n;
    vector<T> dat;

public:
    BinaryIndexedTree(int n) : n(n), dat(n + 1){};
    BinaryIndexedTree(int n, T a) : n(n), dat(n + 1) {
        eFOR(i, 1, n) {
            dat[i] ^= a;
            if (i + (i & -i) <= n) dat[i + (i & -i)] ^= dat[i];
        }
    }
    BinaryIndexedTree(VI v) : n(v.size()), dat(n + 1) {
        eFOR(i, 1, n) {
            dat[i] ^= v[i - 1];
            if (i + (i & -i) <= n) dat[i + (i & -i)] ^= dat[i];
        }
    }
    void add(int i, T a) {
        for (++i; i <= n; i += i & -i) dat[i] ^= a;
    }
    T sum(int r) {  // sum of [0,r)
        T res = 0;
        for (; r; r -= r & -r) res ^= dat[r];
        return res;
    }
    T sum(int l, int r) {  // sum of [l,r)
        if (l < 0 || n < r || l > r) return 0;
        return sum(r) ^ sum(l);
    }
};

int main() {
    init();

    int n;
    cin >> n;
    w_graph<ll> g(n);
    FOR(i, 0, n - 1) {
        int l, r;
        ll a;
        cin >> l >> r >> a;
        --l, --r;
        g[l].emplace_back(r, a);
        g[r].emplace_back(l, a);
    }

    int now = 0;
    VI in(n), out(n), ni(n), p(n, -1);
    VL pc(n);
    auto dfs = [&](auto&& f, int cur, int par) -> void {
        in[cur] = now;
        ni[now] = cur;
        ++now;
        for (auto [to, weight] : g[cur]) {
            if (to == par) continue;
            p[to] = cur;
            pc[to] = weight;
            f(f, to, cur);
        }
        out[cur] = now;
    };
    dfs(dfs, 0, -1);

    BinaryIndexedTree<ll> bit(n);
    set<int> alive;
    FOR(i, 0, n) {
        bit.add(in[p[i]], pc[i]);
        alive.insert(in[i]);
    }
    alive.insert(n + 1);

    int q;
    cin >> q;
    while (q--) {
        int t, x;
        cin >> t >> x;
        --x;
        if (t == 1) {
            for (auto it = alive.lower_bound(in[x]); *it < out[x]; it = alive.lower_bound(in[x])) {
                int cur = ni[*it], par = p[cur];
                bit.add(in[par], pc[cur]);
                pc[cur] = 0;
                alive.erase(it);
            }
        }
        else {
            print(bit.sum(in[x], out[x]));
        }
    }

    return 0;
}