Graph Algorithms · Easy problem

A toll road connects towns $x$ and $z$ directly with a $\$9$ toll ($xz$). An alternate route goes through $y$, with tolls $xy{:}\$3$ and $yz{:}\$4$. What is the cheapest total toll from $x$ to $z$?