10pts 求条

#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;
int n, m, q, a[N];
vector<vector<int>> tree_f;
vector<vector<int>> tree_s;

void dfs(int x, int y) {
	if (tree_f[x].size() == 0) {
		return;
	}
	for (int i = 0; i < tree_f[x].size(); i++) {
		a[tree_f[x][i]] += y;
		dfs(tree_f[x][i], y);
	}
}

int main() {
	cin >> n;
	tree_f.resize(n + 1);
	tree_s.resize(n + 1);
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1, x, y; i < n; i++) {
		cin >> x >> y;
		tree_f[x].push_back(y);
		tree_s[x].push_back(y);
		tree_s[y].push_back(x);
	}
	cin >> m;
	for (int i = 1, p, x, y; i <= m; i++) {
		cin >> p >> x >> y;
		if (p == 1) {
			dfs(x, y);
			a[x] += y;
		} else {
			for (int i = 0; i < tree_s[x].size(); i++) {
				a[tree_s[x][i]] += y;
			}
			a[x] += y;
		}
	}
	cin >> q;
	for (int i = 1, x; i <= q; i++) {
		cin >> x;
		cout << a[x] << '\n';
	}
	
	return 0;
}