#include <iostream>

 #include <cstdio>

 #include <algorithm>

 using namespace std;

 const int maxn = ;

 int n,m,k,fa[maxn],cnt,ans = ;

 int find(int x)

 {

     return fa[x] == x?x:fa[x] = find(fa[x]);

 }

 struct edge{

     int u,v,w;

 }e[maxn];

 int cmp(edge a,edge b)

 {

     return a.w<b.w;

 }

 int main()

 {

     scanf("%d%d%d",&n,&m,&k);

     for(int i = ; i <= n; i++)

     {

         fa[i] = i;

     }

     for(int i = ; i <= m; i++)

     {

         int x,y,z;

         scanf("%d%d%d",&x,&y,&z);

         e[i].u = x;

         e[i].v = y;

         e[i].w = z;

     }

     cnt = n;

     sort(e+,e++m,cmp);

     for(int i = ; i <= m; i++)

     {

         if(cnt <= k) break;

         int x = find(e[i].u);

         int y = find(e[i].v);

         if(x!=y)

         {

             fa[x] = y;

             ans += e[i].w;

             cnt--;

         }

     }

     if(cnt == k)

     {

         printf("%d",ans);

         return ;

     }

     else

     {

         printf("No Answer");

         return ;

     }

 }