帮帮蒟蒻吧，球球了

题目

代码

#include <vector>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 1e6 + 10;
vector<int> G[maxn];
int n, m, x, y, a[maxn], dp[maxn];
void dfs(int u, int f) {
	dp[u] = a[u];
	for (auto v : G[u]) {
		if (v == f) continue;
		dfs(v, u);
		dp[u] = max(dp[u], dp[v]);
	}
	return ;
}
int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i < n; i++) {
		scanf("%d %d", &x, &y);
		G[x].push_back(y);
		G[y].push_back(x);
	}
	for (int i = 1; i <= n; i++) scanf("%d", a + i);
	dfs(m, m);
	for (int i = 1; i <= n; i++) printf("%d\n", dp[i]);
	return 0;
}

关注用小号