import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

class BitSum:
    def __init__(self, n):
        self.n = n+1
        self.table = [0]*self.n

    def add(self, i, x):
        i += 1
        while i < self.n:
            self.table[i] += x
            i += i & -i

    # [0,i]の和
    def sum(self, i):
        i += 1
        res = 0
        while i > 0:
            res += self.table[i]
            i -= i & -i
        return res

    # [l,r)の和
    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r-1)
        return self.sum(r-1)-self.sum(l-1)

    # 数列を度数分布とみたときに、x番目がどのインデックスにあるかを返す
    # xが大きすぎるときは配列の長さnを返す
    def rank(self, x):
        idx = 0
        for lv in range((self.n-1).bit_length()-1, -1, -1):
            mid = idx+(1 << lv)
            if mid >= self.n: continue
            if self.table[mid] < x:
                x -= self.table[mid]
                idx += 1 << lv
        return idx

n=II()
to=[[] for _ in range(n)]
for _ in range(n-1):
    u,v,w=MI()
    to[u].append((v,w))
    to[v].append((u,w))

cc=[0]*n
dd=[0]*n
ll=[0]*n
rr=[0]*n
i=0
first=[True]*n
stack=[0]
while stack:
    u=stack.pop()
    if first[u]:
        first[u]=False
        stack.append(u)
        ll[u]=i
        i+=1
        for v,w in to[u]:
            if first[v]:
                cc[v]=cc[u]+w
                dd[v]=dd[u]+1
                stack.append(v)
    else:
        rr[u]=i
# print(cc)
# print(dd)
# print(ll)
# print(rr)

aa=BitSum(n+3)
bb=BitSum(n+3)
for _ in range(II()):
    task=LI()
    if task[0]==1:
        _,u,w=task
        l,r=ll[u],rr[u]
        aa.add(l,w)
        aa.add(r,-w)
        bb.add(l,-w*dd[u])
        bb.add(r,w*dd[u])
    else:
        u=task[1]
        i=ll[u]
        a=aa.sum(i)
        b=bb.sum(i)
        print(a*dd[u]+b+cc[u])