Graph Algorithms · Hard problem

A weighted graph has vertices $s,a,b,c,d,t$ and edges $sa{:}3, sb{:}5, ab{:}1, ac{:}4, bd{:}6, cd{:}2, ct{:}7, dt{:}3$. What is the length of the shortest path from $s$ to $t$?