#include<bits/stdc++.h>
using namespace std;
#define nl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned ll
#define RV  return void
// #define inf 2000000000
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Mini(x) *min_element(all(x))
#define Maxi(x) *max_element(all(x))
#define fixed(n) fixed << setprecision(n)
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define clr(memo, x) memset(memo, x, sizeof memo)
#define updmin(a, b) a = min(a, b)
#define updmax(a, b) a = max(a, b)
#define vi vector < int >
#define vl vector < ll >
#define vc vector < char >
#define vs vector < string >
#define v2i vector < vector < int > >
#define v2l vector < vector < int > >
#define seti set < int >
#define setl set < ll >
#define mapii map < int , int >
#define mapll map < ll , ll >
#define mapli map < ll , int >
#define mapci map < char , int >
#define mapsi map < string , int >
#define pll pair < ll , ll >
#define pii pair < int , int >
#define range(l,r,x) for(int i=l ; i < r ; i+=x)
#define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
vector < string > ternary= {"NO\n" , "YES\n"};

void  Zainab(){
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);
              freopen("output.txt", "w", stdout);
            #endif
}


/*================================  solution  ================================ */


struct DSU{
    vector < int > Parent , Size ;
        DSU(int mxSize){
            Parent.assign(mxSize+5 , 0);
            Size.assign(mxSize+5 , 1);
            for(int i=0 ; i<=mxSize ; i++)
                Parent[i]=i, Size[i]=1;
        }

        int FindLeader(int node){
            if(Parent[node]==node)
                return node;
            return Parent[node]=FindLeader(Parent[node]);
        }

        bool SameGroup(int u , int v ){
            return FindLeader(u)==FindLeader(v);
        }

        void MergeGroups(int u , int v){
            int LeaderU = FindLeader(u);
            int LeaderV = FindLeader(v);
            if(LeaderU==LeaderV) return;

            if(Size[LeaderV] > Size[LeaderU])
                swap(LeaderU , LeaderV);

            Parent[LeaderV]=LeaderU;
            Size[LeaderU]+=Size[LeaderV];
        }
};


struct Edge{
    int u , v , w ;
};


void myCode(){


int n  , m ;
cin >> n >> m ;

DSU dsu(n);
vector < Edge > ans ;

for(int i =1 ;i <= m ; i++){
   Edge e ;
   cin >> e.u >> e.v >> e.w ;
   ans.pb(e);
}

sort(all(ans) , [&](Edge a , Edge b){
    return a.w < b.w ;
});


for(auto& e : ans){
    if(!dsu.SameGroup(e.u , e.v)){
        dsu.MergeGroups(e.u , e.v);
        cout << e.u << " " << e.v <<  " " << e.w << nl;
    }
}
cout << nl;


}


int main(){

                    FastCode ;
                    Zainab() ;

            int testCase=1;
                // cin >> testCase ;
            for(int i=1 ; i<= testCase ; i++){
                //  cout << "Case #" << i << ": ";
                myCode();
            }


    return 0;
}