2492. Minimum Score of a Path Between Two Cities

There are n cities (1..n) and roads roads[i] = [a, b, dist] — a bidirectional road between a and b of length dist. The graph needn't be connected. A path's score is the minimum road length on it.…