#include <bits/stdc++.h>
using namespace std;
struct lazy_segment_tree{
  int N;
  vector<int> sz;
  vector<long long> ST, lazy;
  lazy_segment_tree(vector<long long> &A){
    int N2 = A.size();
    N = 1;
    while (N < N2){
      N *= 2;
    }
    sz.resize(N * 2 - 1, 1);
    ST.resize(N * 2 - 1, 0);
    for (int i = 0; i < N2; i++){
      ST[N - 1 + i] = A[i];
    }
    for (int i = N - 2; i >= 0; i--){
      sz[i] = sz[i * 2 + 1] + sz[i * 2 + 2];
      ST[i] = ST[i * 2 + 1] + ST[i * 2 + 2];
    }
    lazy.resize(N * 2 - 1, 0);
  }
  void push(int i){
    if (i < N - 1){
      lazy[i * 2 + 1] += lazy[i];
      lazy[i * 2 + 2] += lazy[i];
    }
    ST[i] += lazy[i] * sz[i];
    lazy[i] = 0;
  }
  void range_add(int L, int R, int x, int i, int l, int r){
    push(i);
    if (r <= L || R <= l){
    } else if (L <= l && r <= R){
      lazy[i] = x;
      push(i);
    } else {
      int m = (l + r) / 2;
      range_add(L, R, x, i * 2 + 1, l, m);
      range_add(L, R, x, i * 2 + 2, m, r);
      ST[i] = ST[i * 2 + 1] + ST[i * 2 + 2];
    }
  }
  void range_add(int L, int R, int x){
    range_add(L, R, x, 0, 0, N);
  }
  long long range_sum(int L, int R, int i, int l, int r){
    push(i);
    if (r <= L || R <= l){
      return 0;
    } else if (L <= l && r <= R){
      return ST[i];
    } else {
      int m = (l + r) / 2;
      return range_sum(L, R, i * 2 + 1, l, m) + range_sum(L, R, i * 2 + 2, m, r);
    }
  }
  long long range_sum(int L, int R){
    return range_sum(L, R, 0, 0, N);
  }
};
int main(){
  int N;
  cin >> N;
  vector<vector<pair<int, int>>> E(N);
  for (int i = 0; i < N - 1; i++){
    int u, v, w;
    cin >> u >> v >> w;
    E[u].push_back(make_pair(w, v));
    E[v].push_back(make_pair(w, u));
  }
  vector<int> p(N, -1);
  vector<long long> s(N, 0);
  vector<vector<int>> c(N);
  vector<int> b;
  queue<int> q;
  q.push(0);
  while (!q.empty()){
    int v = q.front();
    q.pop();
    b.push_back(v);
    for (pair<int, int> e : E[v]){
      int w = e.second;
      if (w != p[v]){
        p[w] = v;
        s[w] = e.first;
        c[v].push_back(w);
        q.push(w);
      }
    }
  }
  reverse(b.begin(), b.end());
  vector<int> sz(N, 1);
  for (int v : b){
    for (int &w : c[v]){
      sz[v] += sz[w];
      if (sz[w] > sz[c[v][0]]){
        swap(w, c[v][0]);
      }
    }
  }
  reverse(b.begin(), b.end());
  vector<int> in(N), out(N), next(N);
  in[0] = 0;
  out[0] = N;
  next[0] = 0;
  for (int v : b){
    int t = in[v] + 1;
    for (int w : c[v]){
      if (w == c[v][0]){
        next[w] = next[v];
      } else {
        next[w] = w;
      }
      in[w] = t;
      t += sz[w];
      out[w] = t;
    }
  }
  vector<long long> s2(N);
  for (int i = 0; i < N; i++){
    s2[in[i]] = s[i];
  }
  lazy_segment_tree ST(s2);
  int Q;
  cin >> Q;
  for (int i = 0; i < Q; i++){
    int t;
    cin >> t;
    if (t == 1){
      int a, x;
      cin >> a >> x;
      ST.range_add(in[a] + 1, out[a], x);
    }
    if (t == 2){
      int b;
      cin >> b;
      long long ans = 0;
      while (true){
        ans += ST.range_sum(in[next[b]], in[b] + 1);
        if (next[b] == 0){
          break;
        }
        b = p[next[b]];
      }
      cout << ans << endl;
    }
  }
}