#include <iostream> 
#include <algorithm> 
#include <cstring> 
using namespace std;
const int N=3010;
int n,m,s=1,t,k;
int w[N][N],dis[N],res,cnt;
bool vis[N]; 
void prim(){
	memset(dis,0x3f,sizeof(dis));
	dis[1]=0;
	for(int i=1;i<=n-k+1;i++){
		int u=-1;
		for(int j=1;j<=n;j++){
			if(!vis[j]&&(u==-1||dis[u]>dis[j])){
				u=j;
			}
		}
		vis[u]=1;
		res+=dis[u];
		if(dis[u]==0x3f3f3f3f) {
			cout<<"No Answer";
			return;
		}
		for(int j=1;j<=n;j++){
			if(!vis[j]) dis[j]=min(dis[j],w[u][j]);
		}
	}
	printf("%d",res);
}
int main(){
	scanf("%d%d%d",&n,&m,&k);
	memset(w,0x3f,sizeof(w));
	while(m--){
		int u,v,x;
		scanf("%d%d%d",&u,&v,&x);
		w[u][v]=min(w[u][v],x);
		w[v][u]=min(w[v][u],x);
	}
	prim();
	return 0;
}