Undirected graph is given. The weights of its edges can be or only. Find the shortest distance from source to destination .
The first line contains four integers: number of vertices , number of edges , source and destination . Each of the next lines contains three integers and describing an undirected edge with integer weight .
Print the shortest distance from to .