import sys
from collections import deque

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

    # Build adjacency list
    adj = [[] for _ in range(N+1)]
    for _ in range(N-1):
        a = int(input[ptr])
        b = int(input[ptr+1])
        adj[a].append(b)
        adj[b].append(a)
        ptr +=2

    # Read queries
    queries = []
    for _ in range(Q):
        X = int(input[ptr])
        Y = int(input[ptr+1])
        Z = int(input[ptr+2])
        queries.append((X, Y, Z))
        ptr +=3

    # Process each query
    ans = []
    node_vals = [0] * (N+1)  # 1-based

    for X, Y, Z in queries:
        # Output current value of X
        ans.append(str(node_vals[X]))

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

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

        # Add Z to all nodes in nodes_to_update
        for u in nodes_to_update:
            node_vals[u] += Z

    print('\n'.join(ans))

if __name__ == '__main__':
    main()