#include<iostream>
#include<cstring>
using namespace std;
const int N = 100010;
int e[N], en[N], h[N], match[N], idx; bool str[N]; int p[N];
struct edg
{
int a, b, w;
bool operator < (const edg& W)const
{
return w < W.w;
}
}edgs[N];
int find(int x)
{
if (p[x] != x)
{
p[x] = find(p[x]);
}
return p[x];
}
int main()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++)
{
int a, b, w;
cin >> a >> b >> w;
edgs[i] = { a,b,w };
}
for (int i = 0; i < n; i++)
{
p[i] = i;
}
int res = 0, cnt = 0;
for (int i = 0; i < m; i++)
{
int a, b, w;
a = edgs[i].a; b = edgs[i].b; w = edgs[i].w;
a = find(a); b = find(b);
if (a != b)
{
res += w;
cnt++;
a = p[b];
}
}
if (cnt < n - 1)cout << "-1";
else cout << res;