Sadonkorjuu

let lines = [];
let lineindex = 0;
let toprocess = 0;
function prompt() {
    return lines[lineindex++];
}

function main() {
    let n = parseInt(prompt());
    let cities = {};

    let parts = prompt().split(' ');
    for (let i = 0; i < n; i++) {
        cities[i+1] = {
            hasharbor: parts[i] == '0',
            neighbors: []
        } 
    }

    for (let i = 0; i < n-1; i++) {
        parts = prompt().split(' ');
        let a = parseInt(parts[0]);
        let b = parseInt(parts[1]);
        let dist = parseInt(parts[2]);
        cities[a].neighbors.push({city: b, dist: dist});
        cities[b].neighbors.push({city: a, dist: dist});
    }

    function findpath(a, b) {
        let visited = {};
        let queue = [];
        queue.push({city: a, dist: 0});
        while (queue.length > 0) {
            let current = queue.shift();
            if (current.city == b) {
                return current.dist;
            }
            visited[current.city] = true;
            for (let i = 0; i < cities[current.city].neighbors.length; i++) {
                let neighbor = cities[current.city].neighbors[i];
                if (!visited[neighbor.city]) {
                    queue.push({city: neighbor.city, dist: current.dist + neighbor.dist});
                }
            }
        }
    }
    let total = 0;
    for (let i = 1; i <= n; i++) {
        let city = cities[i];
        if (!city.hasharbor) {
            let closestharbordist = Math.pow(10, 10); 
            for (let j = 1; j <= n; j++) {
                if (cities[j].hasharbor) {
                    let dist = findpath(i, j);
                    if (dist < closestharbordist) {
                        closestharbordist = dist;
                    }
                }
            }
            total += closestharbordist;
        }
    }
    console.log(total.toString());
    process.exit(0);
}

require('readline').createInterface({
    input: process.stdin,
    output: process.stdout,
    terminal: false
}).on('line', function (data) {
    if (toprocess == 0) { toprocess = parseInt(data.split(' ')[0])+1; }
    lines.push(data)
    if (lines.length == toprocess) {
        main();
    }
});

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 1, 2

Verdict: ACCEPTED

Test 16

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 1, 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 30

Group: 1, 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED