Pagini recente » Cod sursa (job #2779363) | Cod sursa (job #463021) | Cod sursa (job #2803683) | Cod sursa (job #2806955) | Cod sursa (job #2663983)
#include <bits/stdc++.h>
using namespace std;
ifstream f("asmax.in");
ofstream g("asmax.out");
int n,v[16005],smax=-1e9;
bitset <16005> viz;
vector <int> V[16005];
void Dfs1(int x)
{
viz[x]=true;
for(int i=0; i<V[x].size(); i++)
if(!viz[V[x][i]])
Dfs1(V[x][i]),v[x]=max(v[x],v[x]+v[V[x][i]]);
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
for(int i=1; i<n; i++)
{
int x,y;
f>>x>>y;
V[x].push_back(y);
V[y].push_back(x);
}
Dfs1(1);
g<<v[1];
return 0;
}