Pagini recente » Cod sursa (job #2687448) | Cod sursa (job #3121866) | Cod sursa (job #812151) | Cod sursa (job #1702816) | Cod sursa (job #2135967)
#include <fstream>
#include <vector>
using namespace std;
const int N=100005;
vector <int> a[N];
bool viz[N];
int m,n,y,s[N];
ifstream cin ("asmax.in");
ofstream cout("asmax.out");
void citire()
{
cin>>n;
int x,y,val;
for(int i=1; i<=n; i++)
{
cin>>val;
s[i]=val;
}
m=n-1;
for(int i=0; i<m; i++)
{
cin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
}
void dfs(int x)
{
viz[x]=true;
int y;
for(int i=0; i<a[x].size(); i++)
{
y=a[x][i];
if(!viz[y])
{
dfs(y);
if(s[y]>0)
{
s[x]+=s[y];
}
}
}
}
int main()
{
citire();
int nr=0, max=-999999999;
for(int i=1; i<=n; i++)
{
if(!viz[i])
{
dfs(i);
//nr++;
}
}
for(int i=1; i<=n; i++)
{
if(max<s[i])
max=s[i];
}
cout<<max;
return 0;
}