#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define maxe 10100
#define maxn 1010
int read()
{
	int x,f=1;
	char ch;
	while(ch=getchar(),!isdigit(ch))if(ch=='-')f=-1;
	x=ch-48;
	while(ch=getchar(),isdigit(ch))x=x*10+ch-48;
	return x*f;
}
void write(int x)
{
	int cnt=0;char ch[50];
	while(ch[++cnt]=x%10+48,x/=10);
	while(putchar(ch[cnt]),--cnt);
	putchar('\n');
}
struct edge
{
	int t,d,n,f;
}a[maxe];
int len,head[maxn],n,m,k,rt[maxn];
void insert(int x,int y,int z)
{
	a[++len].f=x;a[len].t=y;a[len].d=z;a[len].n=head[x];head[x]=len;
}
bool com(const edge & a,const edge & b)
{
	return a.d<b.d;
}
int find(int x)
{
	int xx=x,y;
	while(rt[xx]!=xx)xx=rt[xx];
	while(x!=xx)y=rt[x],rt[x]=xx,x=y;
	return xx;
}
void kruskal()
{
	int cnt=0,ans=0;bool f=0;
	sort(a+1,a+1+len,com);
	for(int i=1;i<=n;i++)rt[i]=i;
	for(int i=1;i<=len;i++)
	{
		int fx=find(a[i].f),fy=find(a[i].t);
		if(fx==fy)continue;
		rt[fx]=fy;
		ans+=a[i].d;
		cnt++;
		if(cnt==n-k)
		{
			f=1;break;
		}
	}
	if(f)write(ans);
	else puts("No Answer");
}
int main()
{
	freopen("cotton.in","r",stdin);
	freopen("cotton.out","w",stdout);
	n=read(),m=read(),k=read();
	for(int i=1;i<=m;i++)
	{
		int x=read(),y=read(),z=read();
		insert(x,y,z);
	}
	kruskal();
}