Submission #6995234

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int N, Q;
int a[200005], b[200005], p[200005];
long long int x[200005];
vector<int>Adj[200005];

int par[200005];
int used[200005];

long long int val[200005];

void DFS(int k) {

	used[k] = 1;

	for (auto y: Adj[k]) {
		if (used[y] == 0) { par[y] = k; val[y] += val[k]; DFS(y); }
	}
}


int main(void) {
	cin >> N >> Q;

	for (int i = 1; i <= N - 1; i++) {
		cin >> a[i] >> b[i];
		Adj[a[i]].push_back(b[i]);
		Adj[b[i]].push_back(a[i]);
	}



	for (int i = 1; i <= Q; i++) {
		cin >> p[i] >> x[i];
		val[p[i]] += x[i];
	}

	DFS(1);

	for (int i = 1; i <= N; i++) {
		if (i != 1) { cout << " "; }
		cout << val[i];
	}cout << endl;

	return 0;
}

Submission Info

Judge Result