Sadonkorjuu

const [[], rawNodes, ...edges] = require("fs").readFileSync(0, "utf8").trim().split("\n").map(l => l.trim().split(" ").map(Number));

/**
 * @typedef Edge
 * 
 * @property {number} cost
 * @property {Node} node
 */

/**
 * @typedef Node
 * 
 * @property {number} id
 * @property {number} value
 * @property {Edge[]} edges
 */

/**
 * @type {Node[]}
 */
const nodes = rawNodes.map((v, i) => ({ id: i + 1, value: v, edges: [] }));

for (const [side1, side2, cost] of edges) {
    nodes[side1 - 1].edges.push({ node: nodes[side2 - 1], cost });
    nodes[side2 - 1].edges.push({ node: nodes[side1 - 1], cost });
}

/**
 * @template V
 */
class Queue {
    /**
     * @type {Record<number, V[]>}
     */
    _internal = {};

    /**
     * @param {V} element
     * @param {number} priority
     * @returns {void}
     **/
    enqueue(element, priority) {
        if (!this._internal[priority]) {
            this._internal[priority] = [];
        }
        this._internal[priority].push(element);
    }

    /**
     * @returns {[V, number]}
     **/
    dequeue() {
        const priorities = Object.keys(this._internal).map(Number).sort((a, b) => a - b);
        const priority = priorities[0];
        const element = this._internal[priority].pop();
        if (!element) throw new Error("bruh");
        if (!this._internal[priority].length) delete this._internal[priority];
        return [element, priority];
    }
}

/**
 * @param {Node} startNode 
 * @returns {number}
 */
function minDistance(startNode) {
    const visited = /** @type {Set<number>} */ (new Set());
    const queue = /** @type {Queue<Node>} */ (new Queue());
    queue.enqueue(startNode, 0);
    while (true) {
        const [node, distance] = queue.dequeue();
        if (visited.has(node.id)) continue;
        visited.add(node.id);
        if (node.value === 0) return distance;
        for (const { node: nextNode, cost } of node.edges) {
            queue.enqueue(nextNode, distance + cost);
        }
    }
}

let sum = 0;

for (const node of nodes) {
    if (node.value === 1) {
        sum += minDistance(node);
    }
}

console.log(sum.toString());

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: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 1, 2

Verdict: ACCEPTED

Test 17

Group: 1, 2

Verdict: ACCEPTED

Test 18

Group: 1, 2

Verdict: ACCEPTED

Test 19

Group: 1, 2

Verdict: ACCEPTED

Test 20

Group: 1, 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 1, 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: ACCEPTED

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: TIME LIMIT EXCEEDED

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED