Challenge: Trace the Complete Path of a Journey

Statement

Given a list paths, where $paths_i$ contains a pair of strings $[source_i, destination_i]$ representing there exists a direct path from $source_i$ to $destination_i$. Return the correct sequence of the whole journey from the first city to the last.

Note: It is guaranteed that a journey always exists.