Graph Algorithms · Easy problem

A delivery network has a warehouse $W$, a store $S$, and hubs $A, B, C$, with road times (minutes) $WA{:}5, WB{:}8, AC{:}4, BC{:}2, CS{:}3, AS{:}10$. What is the shortest delivery time from $W$ to $S$?