Laskettelukeskus

#include <bits/stdc++.h>
#include <unordered_set>
#include <iostream>

using namespace std;
typedef long long ll;
typedef long unsigned int ui;

unordered_map<int, vector<int>> graph;

int dfs(int node, int parent, vector<int>& aurauskerrat) {
    int lumiaurot = 0;
    for (int child : graph[node]) {
        if (child != parent) {
            lumiaurot += dfs(child, node, aurauskerrat);
        }
    }
    lumiaurot = max(lumiaurot, aurauskerrat[node - 1]);
    return lumiaurot;
}

int main() {
    int n;
    cin >> n;

    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    vector<int> aurauskerrat(n);
    for (int i = 0; i < n; i++) {
        cin >> aurauskerrat[i];
    }

    int lumiaurot = dfs(1, 0, aurauskerrat);
    cout << lumiaurot << endl;

    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER