#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(readline())
graph = [[] for _ in range(N)]
for _ in range(N - 1):
    u, v, w = map(int, readline().split())
    graph[u].append((v, w))
Q = int(readline())

par = [0] * N
depth = [0] * N
value = [0] * N
tour = [0]
stack = [0]
Lv = [0] * N
Rv = [0] * N

while stack:
    x = stack[-1]
    if not graph[x]:
        stack.pop()
        Rv[x] = len(tour) - 1
        tour.append(par[x])
        continue
    y, c = graph[x].pop()
    par[y] = x
    depth[y] = depth[x] + 1
    stack.append(y)
    Lv[y] = len(tour)
    tour.append(y)
    value[y] = value[x] + c


class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)

    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data

    def __repr__(self):
        return self.data.__repr__()

    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        data = self.data
        size = self.size
        while i < size:
            data[i] += x
            i += i & -i

    def find_kth_element(self, k):
        data = self.data
        size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1


L = len(tour)
bit0 = BinaryIndexedTree([0] * (L + 10))
bit1 = BinaryIndexedTree([0] * (L + 10))

for query in readlines():
    if query.startswith(b'1'):
        _, v, x = map(int, query.split())
        L = Lv[v]
        R = Rv[v]
        D = depth[v]
        bit1.add(L + 1, x)
        bit1.add(R + 2, -x)
        bit0.add(L + 1, -D * x)
        bit0.add(R + 2, D * x)
    else:
        _, v = map(int, query.split())
        i = Lv[v] + 1
        print(bit1.get_sum(i) * depth[v] + bit0.get_sum(i) + value[v])