You are given various cities, a source city and a destination city.

You can travel

from the source city to the destination city either by train or by
flight. For each city to all of the neighbours you are given both the cost to
travel to that city from the source city either by train or by flight.
You have to calculate the minimum cost required to travel from the source city to
the destination city with the given constrain that you can take
atmost 1 flight.
(This problem came in ICPC Kharagpur Regionals - 2018)