Graph Algorithms · Medium problem

A network connects sites $m,n,o,p,q$ with possible cables and costs $mn{:}4, mo{:}7, no{:}2, op{:}6, oq{:}5, pq{:}3, mp{:}9$. In the minimum spanning tree for this network, what is the weight of the most expensive cable actually used?