Graph Algorithms · Easy problem

A weighted graph has vertices $s,u,v,w,x$ and edges $su{:}3, sv{:}5, uv{:}1, uw{:}6, vw{:}2, wx{:}4$. What is $\delta(v)$, the shortest-path distance from $s$ to $v$?