#include <bits/stdc++.h>
/// Arbore partial de cost minim
/// Algoritmul Prim
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
const int N = 100010;
int n,m,c,x,y,cost;
priority_queue<tuple<int,int,int>> pq;
vector<pair<int,int>>apm,v[N];
bitset<N> viz;
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
        v[y].push_back(make_pair(x,c));
    }
    viz[1]=1;
    for(auto it:v[1])
    {
        tie(y,c)=it;
        pq.push(make_tuple(-c,1,y));
    }
    while(pq.size())
    {
        tie(c,x,y)=pq.top();
        pq.pop();
        if(viz[x])swap(x,y);
        if(viz[x])continue;
        cost+=-c;
        apm.push_back(make_pair(x,y));
        viz[x]=1;
        for(auto it:v[x])
        {
            tie(y,c)=it;
            if(!viz[y])
                pq.push(make_tuple(-c,x,y));
        }
    }
    g<<cost<<'\n'<<apm.size()<<'\n';
    for(auto it:apm)
        g<<it.first<<' '<<it.second<<'\n';
    return 0;
}