int fun(int node, int parent, vector<vector<int> >&adj, vector<int>&weight, int &maxi)
{
    int sum1 = 0;
    for(auto it:adj[node])
    {
        if(it != parent)
        {
            sum1 += fun(it,node,adj,weight,maxi);
        }
    }

    sum1 = max(sum1,weight[node-1]);
    maxi = max(maxi,sum1);
    return sum1;
}

int findMaximumSum(int tree_nodes, vector<int> tree_from, vector<int> tree_to, vector<int> weight)
{
    int n = tree_nodes;

    vector<vector<int> > adj(n+1);
    for(int i = 0; i<tree_from.size(); i++)
    {
        adj[tree_from[i]].push_back(tree_to[i]);
        adj[tree_to[i]].push_back(tree_from[i]);
    }

    int maxi = -1e9;
    fun(1,-1,adj,weight,maxi);
    return maxi;

}

vector<int> countVisibleTowers(vector<int>& height) {
  int n = height.size();
  vector<int> visible(n, 0);
  stack<int> s;

  for (int i = 0; i < n; ++i) {

    visible[i] += s.size();
    while (!s.empty() && height[s.top()] <= height[i]) {
      s.pop();
    }
    s.push(i);
  }

  while (!s.empty()) s.pop();


  for (int i = n - 1; i >= 0; --i) {

    visible[i] += s.size();
    while (!s.empty() && height[s.top()] <= height[i]) {
      s.pop();
    }
    s.push(i);
  }

  return visible;
}