function solution(n, costs) {
let mininumCost = 0;
const sortedCosts = costs.sort((a, b) => a[2] - b[2]);
const parent = Array.from({ length: n }, (_, i) => i);
for (const [a, b, cost] of sortedCosts) {
if (!compare(parent, a, b)) {
mininumCost += cost;
union(parent, a, b);
}
}
return mininumCost;
}