/* -*- coding: utf-8 -*-
 *
 * 900.cc:  No.900 a隆隆itivee - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_E2 = 1 << 19; // = 524288

/* typedef */

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

template <typename T, const int MAX_E2>
struct SegTreeDly {
  int n, e2;
  T nodes[MAX_E2], dls[MAX_E2];
  int ss[MAX_E2];
  SegTreeDly() {}

  void init(int _n) {
    n = _n;
    for (e2 = 1; e2 < n; e2 <<= 1);
  }

  T &get(int i) { return nodes[e2 - 1 + i]; }

  void set(int i, T v, int s) {
    int j = e2 - 1 + i;
    nodes[j] = v, ss[j] = s;
  }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--) {
      int j0 = j * 2 + 1, j1 = j0 + 1;
      nodes[j] = nodes[j0] + nodes[j1];
      ss[j] = ss[j0] + ss[j1];
    }
  }

  void _update(int k) {
    if (dls[k] != 0) {
      int k0 = k * 2 + 1, k1 = k0 + 1;
      nodes[k0] += dls[k] * ss[k0]; dls[k0] += dls[k];
      nodes[k1] += dls[k] * ss[k1]; dls[k1] += dls[k];
      dls[k] = 0;
    }
  }

  void add_range(int r0, int r1, T v, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      nodes[k] += v * ss[k];
      dls[k] += v;
      return;
    }

    _update(k);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    add_range(r0, r1, v, k0, i0, im);
    add_range(r0, r1, v, k1, im, i1);
    nodes[k] = nodes[k0] + nodes[k1];
  }
  void add_range(int r0, int r1, T v) { add_range(r0, r1, v, 0, 0, e2); }

  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return 0;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    _update(k);

    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};

/* global variables */

vpii nbrs[MAX_N];
int prts[MAX_N], pws[MAX_N], cns[MAX_N], rls[MAX_N], rrs[MAX_N];
SegTreeDly<ll,MAX_E2> st;

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 1; i < n; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    nbrs[u].push_back(pii(v, w));
    nbrs[v].push_back(pii(u, w));
  }

  st.init(2 * n);
  prts[0] = -1; pws[0] = 0;
  rls[0] = 0;

  for (int u = 0, k = 0; u >= 0;) {
    int &up = prts[u], &cnu = cns[u];
    vpii &nbru = nbrs[u];

    if (cnu < nbru.size() && nbru[cnu].first == up) cnu++;
    if (cnu >= nbru.size()) {
      rrs[u] = k;
      st.set(k++, -pws[u], -1);
      u = up;
    }
    else {
      int &v = nbru[cnu].first, &w = nbru[cnu].second;
      cnu++;
      prts[v] = u, pws[v] = w;
      st.set(k++, w, 1);
      rls[v] = k;
      u = v;
    }
  }
  st.setall();

  int qn;
  scanf("%d", &qn);

  while (qn--) {
    int op;
    scanf("%d", &op);

    if (op == 1) {
      int a, x;
      scanf("%d%d", &a, &x);
      if (x > 0) st.add_range(rls[a], rrs[a], x);
    }
    else {
      int b;
      scanf("%d", &b);

      ll sum = st.sum_range(0, rls[b]);
      printf("%lld\n", sum);
    }
  }
  return 0;
}