#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1010,maxm=10010;
struct edge{int f,t,c;}e[maxm];
int n,m,k,fa[maxn],cnt,ans=0;
bool cmp(edge x,edge y){
    return x.c<y.c;
}
void init(){
    for(int i=1;i<=n;i++)fa[i]=i;
}
int find(int x){
    if(fa[x]==x)return x;
    return fa[x]=find(fa[x]);
}
void unite(int x,int y){
    x=find(x);y=find(y);
    if(x==y)return;
    fa[x]=y;cnt--;
}
void kru(){
    init();
    sort(e+1,e+1+m,cmp);
    for(int i=1;i<=m;i++){
        if(cnt==k)return;
        if(find(e[i].f)==find(e[i].t))continue;
        unite(e[i].f,e[i].t);
        ans+=e[i].c;
    }
}
int main()
{
    scanf("%d%d%d",&n,&m,&k);cnt=n;
    for(int i=1;i<=m;i++){
        int f,t,c;scanf("%d%d%d",&f,&t,&c);
        e[i]=(edge){f,t,c};
    }
    kru();
    if(k>n||cnt>k)puts("No Answer");
    else printf("%d\n",ans);
    return 0;
}