import sys
from collections import deque

def main():
    sys.setrecursionlimit(1 << 25)
    input = sys.stdin.read
    data = input().split()
    idx = 0

    N = int(data[idx])
    idx += 1
    Q = int(data[idx])
    idx += 1

    # Build adjacency list
    adj = [[] for _ in range(N+1)]
    for _ in range(N-1):
        u = int(data[idx])
        idx += 1
        v = int(data[idx])
        idx += 1
        adj[u].append(v)
        adj[v].append(u)
    
    # Weights initialized to 0
    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
        
        # Step 1: Output current weight of X
        print(weights[X])
        
        # Step 2: Add Z to all nodes within Y distance from X
        visited = set()
        q = deque()
        q.append( (X, 0) )
        visited.add(X)
        
        while q:
            u, d = q.popleft()
            if d > Y:
                continue
            weights[u] += Z
            for v in adj[u]:
                if v not in visited and d + 1 <= Y:
                    visited.add(v)
                    q.append( (v, d + 1) )

if __name__ == "__main__":
    main()