$QAQ$

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
	ll u,v,w;
}e[10001];
ll n,m,k,ans,fa[10001];
bool cmp(node x,node y)
{
    return x.w<y.w;
}
ll find(ll x)
{
    if(fa[x]==x)return x;
    fa[x]=find(fa[x]);
    return fa[x];
}
int main()
{
	cin>>n>>m>>k;
	for(ll i=1;i<=m;i++)cin>>e[i].u>>e[i].v>>e[i].w;
    for(ll i=1;i<=m;i++)fa[i]=i;
    sort(e+1,e+1+m,cmp);
	for(ll i=1;i<=m;i++)
    {
        if(n<=k)
        {
            cout<<ans;
            return 0;
        }
        ll u=find(e[i].u),v=find(e[i].v);
        if(u==v)continue;
        n--;
        ans+=e[i].w;
        fa[u]=v;
    }
	cout<<"No Answer";
}