Graph Algorithms · Easy problem

A network connects towers $p,q,r,s,t$ with possible cables and costs $pq{:}5, pr{:}2, qr{:}3, qs{:}8, rs{:}4, rt{:}6, st{:}1$. What is the minimum total cost to connect all five towers?