You will be given a weighted directed graph of $n$ nodes and $m$ directed edges, where the $i$-th edge has a weight of $w_i$ ($1 \le i \le m$).

You need to reverse some edges of this graph so that there is at least one node in the graph from which every other node is reachable. The cost of these reversals is equal to the maximum weight of all reversed edges. If no edge reversal is required, assume the cost to be $0$.

It is guaranteed that no self-loop or duplicate edge exists.

Find the minimum cost required for completing the task. If there is no solution, print a single integer $-1$.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^5$). The description of the test cases follows.

Each test case begins with a line containing two integers $n$ and $m$ ($2 \le n \le 2 \cdot 10^5$, $1 \le m \le 2 \cdot 10^5$) — the number of nodes in the graph and the number of edges in the graph.

The next $m$ lines of each test case contain $3$ integers each — $u$, $v$, $w$ ($1 \le u, v \le n$, $1 \le w \le 10^9$), indicating an edge from $u$ to $v$ with a weight of $w$. It is guaranteed that no edge connects a vertex to itself, and no pair of edges share the same origin and destination simultaneously.

It is guaranteed that the sum of $n$ and the sum of $m$ over all test cases do not exceed $2 \cdot 10^5$.

Output

For each test case, output the minimum cost. If there is no solution, print $-1$.

Note

In the first test case, an edge exists from $1$ to $2$, so all nodes are reachable (from $1$).

In the second test case, no nodes are reachable from any node no matter what edges we reverse, so the answer is $-1$.

In the third test case, reversing the $4$-th or $5$-th edge allows all nodes to be reachable from $1$. We choose the $5$-th edge here because its weight is smaller.