hdu_1863

/*
 * 先用并查集判断连通性，若不连通，直接输出"?",否则输出最小生成树的值
 * First investigation set to determine connectivity.
 * If none, direct output "?"
 * Otherwise, the output value of the minimum spanning tree
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define MAXN	101

typedef struct $ {
	int u, v, w;
}Point;

int root[MAXN], hash[MAXN];
Point edge[MAXN*MAXN];

int get_root(int x)
{
	if( x == root[x] ) {
		return x;
	}
	return root[x] = get_root(root[x]);
}

int min_spanning_tree(int vertex, int arc)
{
	int rx, ry, ans(0);
	for(int i = 1; i <= vertex; i ++) {
		root[i] = i;
	}
	for(int i = 1; i < vertex; i ++) {
		for(int j = 0; j < arc; j ++) {
			rx = get_root(edge[j].u);
			ry = get_root(edge[j].v);
			if( rx != ry ) {
				root[rx] = ry;
				ans += edge[j].w;
			}
		}
	}
	return ans;
}

int cmp(const Point &a, const Point &b)
{
	return a.w < b.w;
}

int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
	freopen("test.in", "r", stdin);
#endif
	int vertex, arc, u, v, w, rx, ry, cnt;
	while( scanf("%d %d", &arc, &vertex) && arc ) {
		for(int i = 1; i <= vertex; i ++) {
			root[i] = i;
		}
		for(int i = 0; i < arc; i ++) {
			scanf("%d %d %d", &edge[i].u, &edge[i].v, &edge[i].w);
			rx = get_root(edge[i].u);	ry = get_root(edge[i].v);
			if( rx != ry ) {
				root[rx] = ry;
			}
		}
		sort(edge, edge+arc, cmp);
		cnt = 0; memset(hash, 0, sizeof(hash));
		for(int i = 1; i <= vertex; i ++) {
			root[i] = get_root(i);
			hash[root[i]] ++;
		}
		for(int i = 1; i <= vertex; i ++) {
			if( hash[i] ) {
				cnt ++;
			}
		}
		if( 1 != cnt ) {
			printf("?\n");	continue;
		}
		printf("%d\n", min_spanning_tree(vertex, arc));
	}
	return 0;
}