import sys
from collections import deque

def main():
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    Q = int(input[ptr])
    ptr += 1

    edges = [[] for _ in range(N+1)]
    for _ in range(N-1):
        a = int(input[ptr])
        ptr += 1
        b = int(input[ptr])
        ptr += 1
        edges[a].append(b)
        edges[b].append(a)

    weight = [0] * (N + 1)

    for _ in range(Q):
        X = int(input[ptr])
        ptr += 1
        Y = int(input[ptr])
        ptr += 1
        Z = int(input[ptr])
        ptr += 1

        print(weight[X])

        if Y == 0:
            weight[X] += Z
            continue

        visited = [False] * (N + 1)
        q = deque()
        q.append((X, 0))
        visited[X] = True

        while q:
            u, d = q.popleft()
            if d > Y:
                continue
            weight[u] += Z
            for v in edges[u]:
                if not visited[v]:
                    visited[v] = True
                    q.append((v, d + 1))

if __name__ == '__main__':
    main()