Consider the network in the figure below and use Dijkstra's shortest path algorithm to calculate the shortest path from w to network node u at the link cost specified on the network graph, which of the following nodes will be passed through

$($A$)5$

$($B$)4$

$($C$)6$

$($D$)3$

$$