1
#include <bits/stdc++.h>
2
using namespace std;
3

4
typedef pair<int, int> PII;
5

6
const int N = 100010;
7
const int M = 200010;
8
const int INF = 0x3f3f3f3f;
9

10
int n, m;
11
int h[N], e[M], w[M], ne[M], idx;
12
int dista[N];
13
bool st[N];
14

15
void add(int a, int b, int c) {
16
    e[idx] = b;
17
    w[idx] = c;
18
    ne[idx] = h[a];
19
    h[a] = idx++;
20
}
21

22
int prim() {
23
    memset(dista, 0x3f, sizeof dista);
24

25
    priority_queue<PII, vector<PII>, greater<PII>> heap;
26
    heap.push({0, 1});
27
    dista[1] = 0;
28

29
    int cnt = 0;
30
    int ans = 0;
31

32
    while (!heap.empty()) {
33
        auto t = heap.top();
34
        heap.pop();
35

36
        int distance = t.first;
37
        int ver = t.second;
38

39
        if (st[ver]) continue;
40

41
        st[ver] = true;
42
        cnt++;
43
        ans += distance;
44

45
        for (int i = h[ver]; i != -1; i = ne[i]) {
46
            int j = e[i];
47
            int c = w[i];
48

49
            if (!st[j] && c < dista[j]) {
50
                dista[j] = c;
51
                heap.push({dista[j], j});
52
            }
53
        }
54
    }
55

56
    if (cnt < n) return -1;
57
    return ans;
58
}
59

60
int main() {
61
    scanf("%d%d", &n, &m);
62
    memset(h, -1, sizeof h);
63

64
    while (m--) {
65
        int a, b, c;
66
        scanf("%d%d%d", &a, &b, &c);
67
        add(a, b, c);
68
        add(b, a, c);
69
    }
70

71
    printf("%d\n", prim());
72
    return 0;
73
}