#include <bits/stdc++.h>
using namespace std;

template<int n>
struct Segt {
  int64_t atag[n << 2];
  int64_t sums[n << 2];
  int64_t sumv[n << 2];
  Segt(vector<int> s) {
    s.resize(n);
    function<void(int, int, int)> build = [&](int lb, int rb, int t) {
      atag[t] = 0;
      sumv[t] = 0;
      if (rb - lb == 1) return void(sums[t] = s[lb]);
      int mb = lb + rb >> 1;
      build(lb, mb, t << 1);
      build(mb, rb, t << 1 | 1);
      sums[t] = sums[t << 1] + sums[t << 1 | 1];
    };
    build(0, n, 1);
  }
  void push(int t) {
    if (atag[t]) {
      for (int c = 0; c < 2; ++c) {
        atag[t << 1 | c] += atag[t];
        sumv[t << 1 | c] += sums[t << 1 | c] * atag[t];
      }
      atag[t] = 0;
    }
  }
  void add(int v, int ql, int qr, int lb = 0, int rb = n, int t = 1) {
    if (qr <= lb || rb <= ql) return;
    if (ql <= lb && rb <= qr) {
      atag[t] += v;
      sumv[t] += sums[t] * v;
      return;
    }
    push(t);
    int mb = lb + rb >> 1;
    add(v, ql, qr, lb, mb, t << 1);
    add(v, ql, qr, mb, rb, t << 1 | 1);
    sumv[t] = sumv[t << 1] + sumv[t << 1 | 1];
  }
  int64_t query(int ql, int qr, int lb = 0, int rb = n, int t = 1) {
    if (qr <= lb || rb <= ql) return 0;
    if (ql <= lb && rb <= qr) return sumv[t];
    push(t);
    int mb = lb + rb >> 1;
    return query(ql, qr, lb, mb, t << 1) + query(ql, qr, mb, rb, t << 1 | 1);
  }
};

int main() {
  ios::sync_with_stdio(false);

  int N;
  cin >> N;

  vector<vector<pair<int, int>>> G(N);
  for (int i = 0; i < N - 1; ++i) {
    int U, V, W;
    cin >> U >> V >> W;
    G[U].emplace_back(W, V);
  }

  vector<int> lb(N);
  vector<int> rb(N);
  vector<int> sgn(2 * N); {
    int ctr = 0;
    lb[0] = ctr++;
    function<void(int)> dfs = [&](int u) {
      for (int i = 0; i < G[u].size(); ++i) {
        int w, v;
        tie(w, v) = G[u][i];
        lb[v] = ctr++;
        sgn[lb[v]] = +1;
        dfs(v);
        rb[v] = ctr++;
        sgn[rb[v]] = -1;
      }
    };
    dfs(0);
    rb[0] = ctr;
  }

  static Segt<(1 << 18)> tree(sgn);
  for (int u = 0; u < N; ++u) {
    for (int i = 0; i < G[u].size(); ++i) {
      int w, v;
      tie(w, v) = G[u][i];
      tree.add(w, lb[v], lb[v] + 1);
      tree.add(w, rb[v], rb[v] + 1);
    }
  }

  int Q;
  cin >> Q;

  while (Q--) {
    int P;
    cin >> P;

    if (P == 1) {
      int A, X;
      cin >> A >> X;
      tree.add(X, lb[A] + 1, rb[A]);
    } else {
      int B;
      cin >> B;
      cout << tree.query(0, lb[B] + 1) << endl;
    }
  }
  
  return 0;
}