You are given a positive integer n representing n cities numbered from $1$ to n. You are also given a $2$D array roads where roads[i] = [a_i, b_i, distance_i] denotes a bidirectional road connecting city a_i and city b_i with a length equal to distance_i.

The score of a path between two cities is defined as the minimum distance among all roads traversed along that path.

Return the minimum possible score of a path between city $1$ and city n.

Note: A path is a sequence of roads between two cities. A path is allowed to visit the same city or traverse the same road multiple times.

Constraints:

• $2 \leq$ n $\leq 10^5$

• $1 \leq$ roads.length $\leq 10^5$

• roads[i].length $= 3$

• $1 \leq$ a_i, b_i $\leq$ n

• a_i $\neq$ b_i

• $1 \leq$ distance_i $\leq 10^4$

• There are no repeated edges.

• There is at least one path between $1$ and n.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.