题解：P11378 [GESP202412 七级] 燃烧

using namespace std;

vector<int> v[100005];
int c[100005], vis[100005], maxn = -1, n;

int dfs(int u) {
	if (vis[u]) return vis[u];
	int cnt = 1;
	for (int i : v[u])
		if (c[i] < c[u])
			cnt += dfs(i);
	vis[u] = cnt;
	return cnt;
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> c[i];
	for (int i = 1; i < n; i++) {
		int a, b;
		cin >> a >> b;
		v[a].push_back(b);
		v[b].push_back(a);
	}
	for (int i = 1; i <= n; i++) {
		maxn = max(maxn, dfs(i));
	}
	cout << maxn;
	return 0;
}