最大生成树
//376K 32MS
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
struct edge{
int u, v, cost;
edge(int u=0, int v=0, int cost=0) : u(u), v(v), cost(cost){
}
};
const int maxn = 1000;
const int maxm = 20000;
edge es[maxm+5];
int f[maxn+5];
int n, m;
bool cmp(edge i, edge j){
return i.cost > j.cost;
}
void init(){
for(int i=1; i<=n; i++)
f[i] = i;
}
int find(int x){
if(f[x] == x) return x;
else return f[x] = find(f[x]);
}
void bing(int x, int y){
int rx = find(x);
int ry = find(y);
if(rx != ry) f[rx] = ry;
}
bool same(int x, int y){
int rx = find(x);
int ry = find(y);
return rx == ry;
}
int main(){
while(~scanf("%d%d", &n, &m)){
init();
for(int i=1; i<=m; i++){
scanf("%d%d%d", &es[i].u, &es[i].v, &es[i].cost);
}
sort(es+1, es+m+1, cmp);
int cnt = n, res = 0;
for(int i=1; i<=m; i++){
edge e = es[i];
if(!same(e.u, e.v)){
bing(e.u, e.v);
cnt--;
res += e.cost;
}
}
if(cnt == 1) printf("%d\n", res);
else printf("-1\n");
}
return 0;
}