Pagini recente » Cod sursa (job #1978977) | Cod sursa (job #2914000) | Cod sursa (job #433885) | Cod sursa (job #1984244) | Cod sursa (job #2705300)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");
vector<int> l[16005];
int n, v[16005], Max=-10000000, a, b;
bool ok[16005];
void dfs(int x)
{
ok[x] = 1;
for(int i = 0; i < l[x].size(); i++)
{
int y = l[x][i];
if(ok[y] == 0)
{
dfs(y);
if(v[y] > 0)
v[x] += v[y];
}
}
if(Max < v[x])
Max = v[x];
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
for(int i = 1; i < n; i++)
{
fin >> a >> b;
l[a].push_back(b);
l[b].push_back(a);
}
dfs(1);
fout << Max << "\n";
return 0;
}