#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;

const int maxn=10010;

int N,M,K,fa[maxn/10];

struct node
{
       int from,to,dis;
}A[maxn];

bool comp(node a,node b){return a.dis<b.dis;}

int Find(int x)
{
 if(fa[x]!=x)fa[x]=Find(fa[x]);
 return fa[x];
}

int main()
{
    freopen("cotton.in","r",stdin);
    freopen("cotton.out","w",stdout);
    scanf("%d%d%d",&N,&M,&K);
    K=N-K+1;
    for(int i=1;i<=M;i++)scanf("%d%d%d",&A[i].from,&A[i].to,&A[i].dis);
    sort(A+1,A+M+1,comp);
    for(int i=1;i<=N;i++)fa[i]=i;
    int res=0,tot=1;
    for(int rtx,rty,i=1;i<=M;i++)
    {
            rtx=Find(A[i].from),rty=Find(A[i].to);
            if(rtx!=rty)
            {
               fa[rtx]=rty;
               res+=A[i].dis;
                tot++;
                if(tot==K)
                {printf("%d",res);return 0;}           
            }
    }
    printf("No Answer");
    return 0;
}