#include <stdio.h>
#include <iostream>
#include <string.h>using namespace std;
#define INF 0xffffff
const int maxn = 55;
int G[maxn][maxn];//建图
int T, n, m, x, y, num;void prim()
{int Min, sum = 0;int adv[maxn]; //保存定点下标int lowc[maxn]; //保存权值bool flag = false ;adv[0] = lowc[0] = 0 ;//初始化for(int i=1; i<n; i++){lowc[i] = G[0][i];//先放入 第0行 的所有权值adv[i] = 0 ;}//构建过程for(int i=1; i<n; i++){Min = INF ;int j = 1 ;int k = 0 ;while( j < n ){if( lowc[j]!=0 && lowc[j]<=Min){if( lowc[j] == Min ) flag = true ;Min = lowc[j] ;k = j ;}j ++ ;}sum += G[adv[k]][k] ;//计算最小权值lowc[k] = 0 ;//逐行遍历接下来的k个顶点for(int l=1; l<n; l++){if( lowc[l]!=0 && G[k][l] < lowc[l] ){lowc[l] = G[k][l] ;adv[l] = k ;}}}if( flag ) cout << "Not Unique!" << endl ;else cout << sum << endl ;
}int main()
{cin >> T ;while( T -- ){cin >> n >> m ;for(int i=0; i<n; i++)for(int j=0; j<n; j++){if( i == j ) G[i][j] = 0 ;else G[i][j] = INF ;}for(int i=0; i<m; i++){cin >> x >> y >> num ;G[x-1][y-1] = num ;G[y-1][x-1] = num ;}prim();}return 0;
}

//Asimple
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
using namespace std;
#define INF 0xffffff
typedef long long ll ;
const int maxn = 100+5;
int n, T, num, cnt, x, y, t, m, w;
int Map[maxn][maxn];void prim() {int lowc[maxn];for(int i=1; i<=n; i++) lowc[i] = Map[1][i];int sum = 0;bool flag = false;for(int l=1; l<n; l++) {int Min = INF;int k = 0;for(int j=2; j<=n; j++) {if( lowc[j]!=0 && Min > lowc[j] ) {k = j;Min = lowc[j];}}if( Min == INF ) break; sum += Min;int cnt = 0;for(int i=1; i<=n; i++)if( Map[k][i] == lowc[k] )cnt ++;if( cnt > 1 ) {flag = true;break;}lowc[k] = 0;for(int i=2; i<=n; i++) {if( lowc[i] > Map[k][i] ) {lowc[i] = Map[k][i];}}}if( flag ) cout << "Not Unique!" << endl;else cout << sum << endl;
}void input() {ios_base::sync_with_stdio(false);cin >> T;while( T -- ) {cin >> n >> m;for(int i=1; i<=n; i++) {for(int j=1; j<=n; j++) {Map[i][j] = i==j?0:INF;}}while( m -- ) {cin >> x >> y >> w;Map[x][y] = min(Map[x][y], w);Map[y][x] = Map[x][y];}prim();}
}int main() {input();return 0;
}