Graph Algorithms · Medium problem

A weighted graph has vertices $s,a,b,c,d,t$ and edges $sa{:}3, sb{:}5, ac{:}4, bc{:}2, ad{:}6, cd{:}3, dt{:}2, ct{:}7$. A delivery MUST stop at hub $c$ on its way from $s$ to $t$ (visiting any other vertices needed to get there and onward). What is the length of the shortest such route?