#include <cstdio>
#include <vector>
#include <tuple>
#include <bitset>
#include <queue>

using namespace std;

vector<pair<int, int> > vecini[200005];
bitset<200005> viz;
int n, m;

void citire()
{
    scanf("%d %d", &n, &m);

    int tmp1, tmp2, tmp3;

    for(int i = 0; i < m; i++)
    {
        scanf("%d %d %d", &tmp1, &tmp2, &tmp3);

        vecini[tmp1].push_back(make_pair(tmp3, tmp2));
        vecini[tmp2].push_back(make_pair(tmp3, tmp1));
    }
}

void arboreCostMinim()
{
    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int> >, greater<tuple<int, int, int> > > Q;

    int l = vecini[1].size();

    for(int i = 0; i < l; i++)
    {
        priority_queue.push(make_tuple(vecini[1].first, 1, vecini[1].second));
    }

}

int main()
{
    citire();
    //arboreCostMinim();

    printf("\ntest");

    return 0;
}