http://acm.hdu.edu.cn/showproblem.php?pid=1520
思路:树形dp;dp[u][0]表示不选u,dp[u][1]表示选u
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/
//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复,故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------
/*
//----------------------------------------------------------
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++;
}
inline int read() {
int x = 0, f = 1;char c = Getchar();
for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
return x * f;
}
//----------------------------------------------------------
*/
const int maxn=6e3+9;
const int maxm=4e5+9;
const int mod=1e9+7;
struct E
{
int to,nex;
}edge[maxn<<1];
int head[maxn];
int tot;
void addedge(int u,int v)
{
edge[tot].to=v;
edge[tot].nex=head[u];
head[u]=tot++;
}
int dp[maxn][2];
int in[maxn];
void init()
{
mem(head,-1);
tot=0;
mem(dp,0);
mem(in,0);
}
bool vis[maxn];
void dfs(int u)
{
for(int i=head[u];i!=-1;i=edge[i].nex)
{
int v=edge[i].to;
dfs(v);
dp[u][0]+=max(dp[v][0],dp[v][1]);
dp[u][1]+=dp[v][0];
}
}
int n,m;
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
while(cin>>n)
{
init();
for(int i=1;i<=n;i++)
{
cin>>dp[i][1];
}
int a,b;
while(cin>>a>>b&&a&&b)
{
addedge(b,a);
in[a]++;
}
int rt=1;
for(int i=1;i<=n;i++)
{
if(in[i]==0)
{
rt=i;
break;
}
}
dfs(rt);
cout<<max(dp[rt][1],dp[rt][0])<<endl;
}
return 0;
}