#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#define maxn 1001
using namespace std;
class edge{
public:
	int from,to,dis;
	bool operator < (const edge e)const{
		return dis<e.dis;
	}
};
vector<edge> edges;
int f[maxn]={0};
int n,m,k;
void init(){
	for (int i=1;i<=n;i++) f[i]=i;
}
int find(int x){
	return x==f[x]?x:f[x]=find(f[x]);
}
void read(){
	int u,v,w;
	scanf("%d%d%d",&n,&m,&k);
	for (int i=1;i<=m;i++){
		scanf("%d%d%d",&u,&v,&w);
		edges.push_back((edge){u,v,w});
	}
	sort(edges.begin(),edges.end());
	int tot=n,i=0,ans=0;
	init();
	while(tot>k&&i!=edges.size()){
		edge e=edges[i++];
		u=find(e.from); v=find(e.to);
		if (u==v) continue;
		else{
			f[u]=v;
			tot--;
			ans+=e.dis;
		}
	}
	if (tot!=k) printf("No Answer\n");
	else printf("%d",ans);
}
int main(){
	freopen("cotton.in","r",stdin);
	freopen("cotton.out","w",stdout);
	read();
}