Graph Algorithms · Easy problem

A network connects stations $a,b,c,d,e$ with possible cables and costs $ab{:}3, ac{:}6, bc{:}2, bd{:}5, cd{:}4, ce{:}7, de{:}1$. Running Prim's algorithm starting from $a$, what is the total weight of the minimum spanning tree it builds?