#include <bits/stdc++.h>

using namespace std;

using i64 = long long;
using pii = pair<int, int>;
const int N = 1 << 18;

int n, dfn[N], sz[N], dep[N], dcnt;

vector<pii> g[N];

i64 tr[N * 4], buff[N * 4];

void modify(int i, int l, int r, int ql, int qr, int x, int y) {
    if(l >= qr || r <= ql) return;
    if(l >= ql && r <= qr) {
        tr[i] += x;
        buff[i] += y;
        return;
    }
    int mid = (l + r) / 2;
    modify(i * 2, l, mid, ql, qr, x, y);
    modify(i*2+1, mid, r, ql, qr, x, y);
}

void dfs(int u) {
    sz[u] = 1;
    dfn[u] = ++dcnt;

    for(auto [v, w] : g[u]) {
        dep[v] = dep[u] + 1;
        dfs(v);
        
        sz[u] += sz[v];
        modify(1, 1, n + 1, dfn[v], dfn[v] + sz[v], w, 0);
    }
}

i64 query(int i, int l, int r, int p, int d) {
    if(l + 1 == r) return tr[i] + d * buff[i];
    int mid = (l + r) / 2;
    if(p < mid) return tr[i] + d * buff[i] + query(i * 2, l, mid, p, d);
    else return tr[i] + d * buff[i] + query(i * 2 + 1, mid, r, p, d);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    for(int i = 1, u, v, w; i < n; i ++) {
        cin >> u >> v >> w;
        g[u].emplace_back(v, w);
    }
    
    dfs(0);

    int q;
    cin >> q;

    for(int i = 0, op, x, y; i < q; i ++) {
        cin >> op;
        if(op == 1) {
            cin >> x >> y;
            modify(1, 1, n + 1, dfn[x], dfn[x] + sz[x], -y * dep[x], y);
        }else{
            cin >> x;
            cout << query(1, 1, n + 1, dfn[x], dep[x]) << "\n";
        }

    }
}