#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int fa[10100];
struct Edge{
	int f,t,v;
}E[30010];
bool cmp(Edge a,Edge b){
	return a.v<b.v;
}
inline int find(int x){
	if(x==fa[x])
		return x;
	return fa[x]=find(fa[x]);
}
int main(){
	freopen("cotton.in","r",stdin);
	freopen("cotton.out","w",stdout);
	int n,m,k;
	cin>>n>>m>>k;
	for(int i=1;i<=m;i++){
		cin>>E[i].f>>E[i].t>>E[i].v;
	}
	for(int i=1;i<=n;i++)
		fa[i]=i;
	sort(E+1,E+m+1,cmp);
	int left=n;
	int ans=0;
	for(int i=1;i<=m;i++){
		int ff=find(E[i].f),ft=find(E[i].t);
		if(ff!=ft){
			fa[ff]=ft;
			left--;
			ans+=E[i].v;
		}
		if(left==k)
			break;
	}
	if(left==k)
		cout<<ans<<endl;
	else cout<<"No Answer"<<endl;
return 0;
}