problem:

Given two vertices of a graph,those are start point and end point and the weights of all edges in the graph are given.There are many paths exist from start vertex to end vertex.Find the weight of the minimum weighted edge that is present on each of those paths and find the maximum of those minimum weights.

input:

start point end point N — no. of edges

then N lines showing edges and their weights node1,node2,weight.

output:

out the maximum of those minimum weights .

note: the graph is connected and undirected.