Given a weighted graph, find the minimum cost of any path from node S to node T , via node V (visiting node V is compulsory) , where cost of a path is the sum of weights of **distinct** edges occurring in path

N nodes, M edges

N,M <= 1e5

weight of edges <= 1e9

Solution: Link