You're not constructing a Hamilton circuit (or not yet) according to the question, just a weighted graph. I suggest that you convert all the times to minutes and then just label the appropriate edges of the graph with the time in minutes. (Fortunately the time is the same in both directions). Don't try to scale the edge lengths to the weights. Given the correlation of distance and flight time, you might as well lay the vertices out roughly geographically, but also conveniently for reading the weights. You're not drawing a map: it's a graph.
Then later, if you are using this graph to find a Hamiltonian circuit, since this is a complete graph, you will have to choose an arbitrary start point (it's a circuit, so this doesn't increase the options), then $4$ choices, $3$ choices, $2$ choices, and two forced choices for $4!=24$ different circuits, or $4!/2=12$ if the reversed circuit counts as the same.