#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
#include <iomanip>
#include <tuple>
#include <unordered_set>
#include <unordered_map>

using namespace std;

void dfs(vector<vector<int>>& graph, int curr, vector<int>& currSum, int currentSum, vector<int>& addedValues) {
	currSum[curr] += currentSum;
	for (auto vertex : graph[curr]) {

		dfs(graph, vertex, currSum, currentSum + addedValues[vertex], addedValues);
	}
}

int main() {
	int n, q;
	cin >> n >> q;

	vector<vector<int>> graph(n + 1);
	vector<int> addedValues(n + 1);

	for (int i = 0; i < n - 1; i++) {
		int a, b;
		cin >> a >> b;
		graph[a].push_back(b);
	}

	for (int i = 0; i < q; i++) {
		int root, val;
		cin >> root >> val;
		addedValues[root] += val;
	}

	vector<int> sums(n + 1);

	dfs(graph, 1, sums, addedValues[1], addedValues);

	for (int i = 1; i <= n; i++) {
		cout << sums[i] << " ";
	}

}