Graph Algorithms · Easy problem

A weighted graph has vertices $s,a,b,c,d,e$ and edges $sa{:}4, sb{:}2, ac{:}3, bc{:}5, bd{:}6, ce{:}2, de{:}1$. What is the length of the shortest path from $s$ to $e$?