#include <bits/stdc++.h>

using namespace std;

struct Edge {
    int x, y;
    int cost;
};

istream& operator>>(istream& in, Edge& x) {
    return in >> x.x >> x.y >> x.cost;
}

int main() {
    ifstream in("/dev/stdin");
    ofstream out("/dev/stdout");
    int n, m;
    in >> n >> m;
    vector<Edge> allEdges(m);
    vector<Edge> resultEdges;
    for (auto& x : allEdges)
        in >> x;
    ranges::sort(allEdges, {}, &Edge::cost);
    unsigned long long cost_total = 0;
    vector<int> set(n+1);
    for (int i = 1; i <= n; i++)
        set[i] = i;

    function<int(int)> getRoot = [&](int x) {
        if (x == set[x])
            return x;
        return set[x] = getRoot(set[x]);
    };

    for (const auto& edge : allEdges) {

    }
}