#include<stdio.h>
#include<algorithm>
#include<stdio.h>
int pre[2000];
using namespace std;
struct point
{
int x,y,z;
}
a[2000];
bool cmp(point a,point b)
{
return a.z<b.z;
}
int fun(int x)
{
if(x!=pre[x])
pre[x]=fun(pre[x]);
return pre[x];
}
int main()
{
int m,n,i,j,k,h,sum,p;
while(scanf("%d",&m),m)
{
sum=p=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
pre[i]=i;
for(i=1;i<=m;i++)
scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
sort(a+1,a+1+m,cmp);
for(i=1;i<=m;i++)
{
int k,h;
k=fun(a[i].x);
h=fun(a[i].y);
if(k!=h)
{
pre[h]=k;
sum+=a[i].z;
p++;
}
}
if(p==n-1)
printf("%d\n",sum);
else
printf("?\n");
}
return 0;
}