[codevs1380]没有上司的舞会（[BZOJ2060][Usaco2010 Nov]Visiting Cows 拜访奶牛）

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <map>
#include <set>
using namespace std;

const int BufferSize = 1 << 16;
char buffer[BufferSize], *Head, *Tail;
inline char Getchar() {
    if(Head == Tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        Tail = (Head = buffer) + l;
    }
    return *Head++;
}
int read() {
    int x = 0, f = 1; char c = Getchar();
    while(!isdigit(c)){ if(c == ‘-‘) f = -1; c = Getchar(); }
    while(isdigit(c)){ x = x * 10 + c - ‘0‘; c = Getchar(); }
    return x * f;
}

#define maxn 6010
#define maxm 12010
int n, m, head[maxn], next[maxm], to[maxm], val[maxn];

void AddEdge(int a, int b) {
	to[++m] = b; next[m] = head[a]; head[a] = m;
	swap(a, b);
	to[++m] = b; next[m] = head[a]; head[a] = m;
	return ;
}

int f[2][maxn];
void dp(int u, int fa) {
	f[0][u] = 0; f[1][u] = val[u];
	for(int e = head[u]; e; e = next[e]) if(to[e] != fa) {
		dp(to[e], u);
		f[0][u] += max(f[0][to[e]], f[1][to[e]]);
		f[1][u] += f[0][to[e]];
	}
	return ;
}

int main() {
	n = read();
	for(int i = 1; i <= n; i++) val[i] = read();
	for(int i = 1; i < n; i++) {
		int a = read(), b = read();
		AddEdge(a, b);
	}
	read(); read();
	
	dp(1, 0);
	
	printf("%d\n", max(f[0][1], f[1][1]));
	
	return 0;
}