Shortest path from cities to gas stations (No fuel, but roads are weighted)

Question

In a directed graph with weights on the edges, representing the length of the different roads between nodes. Some of the nodes are gas stations, the others are cities. How c