How to find the edge which reduces the cost of the shortest path from s to t the most in O((|V|+|E|)lg|V|)?

Question

In a directed weighted graph from list of k weighted edges not already in the graph how to find the edge which reduces the cost of the shortest path from s to t the most i