import sys
from collections import deque

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

    # Build the tree
    adj = [[] for _ in range(N+1)]
    for _ in range(N-1):
        a = int(data[idx])
        idx +=1
        b = int(data[idx])
        idx +=1
        adj[a].append(b)
        adj[b].append(a)

    # Initialize weights
    weights = [0] * (N+1)

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

        # Output current weight of X
        print(weights[X])

        # BFS to find all nodes within Y distance
        visited = [False] * (N+1)
        q = deque()
        q.append((X, 0))
        visited[X] = True

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

if __name__ == '__main__':
    main()