B"You are given a connected weighted graph with n vertices and m edges. The graph doesn't contain loops nor multiple edges. Consider some edge with id i. Let's determine for this edge the maximum integer weight we can give to it so that it is contained in all minimum spanning trees of the graph if we don't change the other weights. You are to determine this maximum weight described above for each edge. You should calculate the answer for each edge independently, it means there can't be two edges with changed weights at the same time. The first line contains two integers n and m (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892 xc2 xb7105, n xe2 x80 x89- xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892 xc2 xb7105), where n and m are the number of vertices and the number of edges in the graph, respectively. Each of the next m lines contains three integers u, v and c (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89v, xe2 x80 x89u xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, v xe2 x80 x89 xe2 x89 xa0 xe2 x80 x89u, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89c xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) meaning that there is an edge between vertices u and v with weight c. Print the answer for each edge in the order the edges are given in the input. If an edge is contained in every minimum spanning tree with any weight, print -1 as the answer. "...