#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

void dfs(vector<vector<pll>> &graph, vector<bool> &isvisited, ll v,
         vector<ll> &euler_tour_v, vector<ll> &euler_tour_e) {
    isvisited[v] = true;
    for (pll p : graph[v]) {
        if (isvisited[p.first]) {
            continue;
        }
        euler_tour_v.push_back(v);
        euler_tour_e.push_back(p.second);
        dfs(graph, isvisited, p.first, euler_tour_v, euler_tour_e);
        euler_tour_e.push_back(p.second);
    }
    euler_tour_v.push_back(v);
}

struct S {
    ll value;
    ll sign;
};

S op(S a, S b) { return S{a.value + b.value, a.sign + b.sign}; }

S e() { return S{0, 0}; }

S mapping(ll f, S x) { return S{x.value + x.sign * f, x.sign}; }

ll composition(ll f, ll g) { return f + g; }

ll id() { return 0LL; }

int main() {
    ll N;
    cin >> N;
    vector<ll> u(N - 1);
    vector<ll> v(N - 1);
    vector<ll> w(N - 1);
    for (ll i = 0; i < N - 1; i++) {
        cin >> u[i] >> v[i] >> w[i];
    }
    vector graph(N, vector<pll>(0));
    for (ll i = 0; i < N - 1; i++) {
        graph[u[i]].push_back(make_pair(v[i], i));
        graph[v[i]].push_back(make_pair(u[i], i));
    }
    vector<bool> isvisited(N, false);
    vector<ll> euler_tour_v(0);
    vector<ll> euler_tour_e(0);

    dfs(graph, isvisited, 0, euler_tour_v, euler_tour_e);
    // debug(euler_tour_v);
    // debug(euler_tour_e);

    vector<ll> in(N, 2 * N + 1);
    vector<ll> out(N, -1);
    for (ll i = 0; i < 2 * N - 1; i++) {
        in[euler_tour_v[i]] = min(in[euler_tour_v[i]], i);
        out[euler_tour_v[i]] = max(out[euler_tour_v[i]], i);
    }
    // debug(in);
    // debug(out);

    // 辺属性を持つことにする
    lazy_segtree<S, op, e, ll, mapping, composition, id> seg(2 * (N - 1));
    vector<bool> seen(N, false);
    for (ll i = 0; i < 2 * (N - 1); i++) {
        if (seen[euler_tour_e[i]]) {
            seg.set(i, S{-w[euler_tour_e[i]], -1});
        } else {
            seg.set(i, S{w[euler_tour_e[i]], 1});
        }
        seen[euler_tour_e[i]] = true;
    }
    ll Q;
    cin >> Q;
    for (ll i = 0; i < Q; i++) {
        ll t;
        cin >> t;
        if (t == 1) {
            ll a, x;
            cin >> a >> x;
            seg.apply(in[a], out[a], x);
        } else {
            ll b;
            cin >> b;
            cout << seg.prod(0, in[b]).value << endl;
        }
    }
}