Migrated from Lutece 264 Unique MST

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

Given a connected undirected graph, tell if its minimum spanning tree is unique.

Definition $1$ (Spanning Tree):

Consider a connected, undirected graph $G = (V, E)$. A spanning tree of $G$ is a subgraph of $G$, say $T = (V', E')$, with the following properties:

1. $V' = V$.
2. $T$ is connected and acyclic.

Definition $2$ (Minimum Spanning Tree):

Consider an edge-weighted, connected, undirected graph $G = (V, E)$. The minimum spanning tree $T = (V, E')$ of $G$ is the spanning tree that has the smallest total cost. The total cost of $T$ means the sum of the weights on all the edges in $E'$.

Input

The first line contains a single integer $t (1 \leq t \leq 100)$, the number of test cases. Each case represents a graph. It begins with a line containing two integers $n$ and $m (1 \leq n \leq 100)$, the number of nodes and edges. Each of the following m lines contains a triple $(x_i, y_i, w_i)$, indicating that $x_i$ and $y_i$ are connected by an edge with weight = $w_i. (1 \leq x_i \leq n,1 \leq yi \leq n,x_i ≠ y_i,0 \leq w_i \leq 10000)$.For any two nodes, there is at most one edge connecting them.

Output

For each input, if the MST is unique, print the total cost of it, or otherwise print the string Not Unique!

Samples

2
3 3
1 2 1
2 3 2
3 1 3
4 4
1 2 2
2 3 2
3 4 2
4 1 2

3
Not Unique!

Note

The data used in this problem is unofficial data prepared by Nilil. So any mistake here does not imply mistake in the offcial judge data.

Resources

POJ Monthly--2004.06.27 srbga@POJ