#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAXN = 1100;
const int MAXM = 40040;
struct EdgeNode
{
int from;
int to;
int w;
}Edges[MAXM];
int father[MAXN];
int find(int x)
{
if(x != father[x])
father[x] = find(father[x]);
return father[x];
}
int cmp(EdgeNode a,EdgeNode b)
{
return a.w > b.w;
}
void Kruskal(int N,int M)
{
sort(Edges,Edges+M,cmp);
int ans = 0,Count = 0;
for(int i = 0; i < M; ++i)
{
int u = find(Edges[i].from);
int v = find(Edges[i].to);
if(u != v)
{
ans += Edges[i].w;
father[v] = u;
Count++;
if(Count == N-1)
break;
}
}
if(Count == N-1)
cout << ans << endl;
else
cout << "-1" << endl;
}
int main()
{
int N,M;
while(~scanf("%d%d",&N,&M))
{
for(int i = 1; i <= N; ++i)
father[i] = i;
for(int i = 0; i < M; ++i)
{
scanf("%d%d%d",&Edges[i].from, &Edges[i].to, &Edges[i].w);
}
Kruskal(N,M);
}
return 0;
}
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAXN = 1100;
const int MAXM = 40040;
struct EdgeNode
{
int from;
int to;
int w;
}Edges[MAXM];
int father[MAXN];
int find(int x)
{
if(x != father[x])
father[x] = find(father[x]);
return father[x];
}
int cmp(EdgeNode a,EdgeNode b)
{
return a.w > b.w;
}
void Kruskal(int N,int M)
{
sort(Edges,Edges+M,cmp);
int ans = 0,Count = 0;
for(int i = 0; i < M; ++i)
{
int u = find(Edges[i].from);
int v = find(Edges[i].to);
if(u != v)
{
ans += Edges[i].w;
father[v] = u;
Count++;
if(Count == N-1)
break;
}
}
if(Count == N-1)
cout << ans << endl;
else
cout << "-1" << endl;
}
int main()
{
int N,M;
while(~scanf("%d%d",&N,&M))
{
for(int i = 1; i <= N; ++i)
father[i] = i;
for(int i = 0; i < M; ++i)
{
scanf("%d%d%d",&Edges[i].from, &Edges[i].to, &Edges[i].w);
}
Kruskal(N,M);
}
return 0;
}