So it's not hard to show that always you have either one of the two distances from, from the source on the queue, and that means the first time we get to a vertex, that's the shortest path to that vertex. 