Prim's algorithm problem:

In the Prim-Dijkstra-Jarnik algorithm for minimum spanning trees, different choices of starting vertex can cause the algorithm to find the minimum spanning tree edges in different orders.

Describe how to construct a weighted graph on any given number n of vertices, in which all the edge weights are unique and there is only one pair (p,q) of vertices that lead to the same edge order.