please write code in python please !

The weighted, undirected graph below represents a transit system that is operated on a daily schedule, in which the vertices are train stations, the edges are the tracks that travel between the stations, and the weights are three-element tuples, the first element is the first departure time of a day, the second element is the interval between trains, and the third element is the travel time between two stations. For example, (20,30,15) means the first train will depart at 0:20 and arrive at the other station at 0:35. Trains will continue departing at 30 minutes intervals. Subsequently, the next train will depart at 0:50, and so on. Modify the Dijkstra's algorithm to find the fastest routes to travel from a given station to all other stations given the time you arrive at the station (you may need to wait for the next available train). Write a function called problem5(G). Test case: there are five train stations, A, B, C, D, and E. Find the fastest routes from station A to all other