CF827D.Best Edge Weight

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.

给你一个包含 $n$ 个顶点和 $m$ 条边的连通带权图。该图不含自环或重边。考虑某条编号为 $i$ 的边。请确定：在不改变其余所有边权重的前提下，该边所能被赋予的最大整数权重，使得它必然出现在图的所有最小生成树中。

你需要对每条边分别计算上述最大权重。注意：每条边的答案需独立计算，即任意时刻至多只允许一条边的权重被修改。

The first line contains two integers n and m (2 ≤ n ≤ 2·105, n - 1 ≤ m ≤ 2·105), 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 ≤ v, u ≤ n, v ≠ u, 1 ≤ c ≤ 109) meaning that there is an edge between vertices u and v with weight c.

第一行包含两个整数 $n$ 和 $m$（$2 \leq n \leq 2 \cdot 10^5$，$n-1 \leq m \leq 2 \cdot 10^5$），分别表示图中顶点的数量和边的数量。

接下来的 $m$ 行，每行包含三个整数 $u$、$v$ 和 $c$（$1 \leq u, v \leq n$，$u \neq v$，$1 \leq c \leq 10^9$），表示顶点 $u$ 与顶点 $v$ 之间存在一条权重为 $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.

按输入中给出边的顺序，为每条边输出答案。如果某条边在任意权值下都属于每一棵最小生成树，则输出 -1 作为该边的答案。