次小生成树

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=30010,maxm=150010,INF=100000000;
struct node{
	int x,y,w,f;
};
struct node a[maxm],tmp;
int f[maxn],rank[maxn],pre[maxn],pres[maxn],p[maxn],n,ansx[maxm];
int e,to[maxm],next[maxm],begin[maxn],ss[maxm];
int cmp(node a,node b){
	return a.w<b.w ;}
int fa(int u){
	if(f[u]!=u)
		f[u]=fa(f[u]);
	return f[u];
}
int find(int u,int v){
	return fa(u)==fa(v)?0:1;
}
void link(int u,int v){
	if(rank[fa(u)]>=rank[fa(v)]){
		f[fa(v)]=fa(u);
		rank[fa(u)]++;
	}else{
		f[fa(u)]=fa(v);
		rank[fa(v)]++;
	}
}
void dfs(int u,int v){
	int i,j,k;
	if(u==v)return;
	p[u]=1;
	for(i=begin[u];i;i=next[i]){
		k=to[i];
		if(p[k]==0){
			pre[k]=u;
			pres[k]=ss[i];
			dfs(k,v);
		}
	}
}
int main(){

	int i,j,k,m,_,s;
	scanf("%d",&_);
	while(_--){
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)f[i]=i;
	for(i=1;i<=m;i++)
		scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].w);		
	sort(a+1,a+m+1,cmp);
	s=n-1;
	int ans=0;
	for(i=1;i<=m,s;i++){
		if(find(a[i].x,a[i].y)){
			link(a[i].x,a[i].y);
			to[++e]=a[i].y;
			next[e]=begin[a[i].x];
			begin[a[i].x]=e;
			ss[e]=a[i].w;
			
			to[++e]=a[i].x;
			next[e]=begin[a[i].y];
			begin[a[i].y]=e;
			ss[e]=a[i].w;
			
			a[i].f=1;	
			s--;
			ans+=a[i].w ;
			}
		}

	int t=0;
	for(i=1;i<=m;i++){
		if(a[i].f==0){			
			memset(p,0,sizeof(p));
			j=a[i].y;
			dfs(a[i].x,a[i].y);
			int max=0;
			while(j!=a[i].x){
				if(pres[j]>max)
					max=pres[j];				
				j=pre[j];
			}	
			ansx[++t]=ans-max+a[i].w;
		}	
	}
	int minans=INF;
	for(i=1;i<=t;i++)
		if(ansx[i]<minans)minans=ansx[i];
		if(ans==minans)printf("Not Unique!\n");
		else printf("%d\n",ans);		
}
	return 0;
}