MST

#include <bits/stdc++.h>
using namespace std;
const int M = 6e3+5;
const int N = 1e2+5;
bool visited[N];
vector<pair<int, pair<int, int>>>edges;

int main ()
{
    int n, m;
    cin >> n >> m;
    int x, y, z;
    for (int i = 0; i < m; i++) {
        cin >> x >> y >> z;
        edges.push_back({z, {x, y}});
    }
    sort(edges.begin(), edges.end());

    int cnt = 0;
    int totalWeight = 0;
    for (pair<int, pair<int, int>> i : edges) {
        if (cnt == n-1)
            break;
        int f = i.second.first;
        int s = i.second.second;
        if (!visited[f] || !visited[s]) {
            visited[f] = true;
            visited[s] = true;
            totalWeight += i.first;
            cnt++;
        }
    }
    cout << totalWeight << endl;
    return 0;
}