Doubt in Dijkstra's Algorithm

In this link:
While traversing the nodes, I don’t understand why we traverse 5 after traversing 3, and not 4.
Can someone help please?

We pick the vertex with shortest distance and uptade the distances of its neighbors…here 5 has shorter distance than 4…so we visit 5 first

Oh okay, so the smallest vertex mentioned there means the unvisited vertex with least distance?