/** /// Bellman Ford
#include <bits/stdc++.h>
# define INF 0x3f3f3f3f
#define nmax 50002
using namespace std;
ifstream f("bellmanford1.in");
ofstream g("bellmanford.out");
int n,m,x,y,cost,ok,dist[nmax],nr,viz[nmax];
vector< pair<int, int> > v[nmax];
queue<int> c;
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y>>cost;
        v[x].push_back(make_pair(y,cost));
    }

    memset(dist,INF,sizeof(dist));
    dist[1]=0;
    c.push(1);
    while(!c.empty())
    {
        nr=c.front();
        c.pop();
        viz[nr]++;
        if(viz[nr]==n)
        {
            g<<"Ciclu negativ!"<<'\n';
            ok=1;
            break;
        }
        for(int i=0;i<v[nr].size();i++)
        if(dist[v[nr][i].first]>dist[nr]+v[nr][i].second)
        {
            dist[v[nr][i].first]=dist[nr]+v[nr][i].second;
            c.push(v[nr][i].first);
        }
    }
    if(!ok)
    {
        for(int i=2;i<=n;i++)
            if(dist[i]==INF) g<<"0"<<" ";
                        else g<<dist[i]<<" ";
        g<<'\n';
    }
    return 0;
}
**/

#include <bits/stdc++.h>

using namespace std;

ifstream inf("apm.in");
ofstream outf("apm.out");

const int N=200010;
int n, m, i, j, t[N], x, y, c, cost, a, b, compr(int );
pair<int, pair<int,int> > M[2*N];
vector<pair<int,int> > sol;
int main()
{
    inf>>n>>m;

    for(i=1; i<=n; i++)
        t[i]=i;
    for(i=1;i<=m;i++)
    {
        inf>>x>>y>>c;
        M[i]={c,{x,y}};
    }
    sort(M+1, M+m+1);
    for(i=1,j=n-1; j; i++)
    {
        a=M[i].second.first;
        b=M[i].second.second;
        x=compr(a);
        y=compr(b);
        if(x!=y)
        {
            t[x]=y;
            cost+=M[i].first;
            sol.push_back({a,b});
            j--;
        }
    }
    outf<<cost<<'\n'<<n-1<<'\n';
    for(vector<pair<int,int> >:: iterator i=sol.begin();i!=sol.end();i++)
        outf<< i->first <<" "<<i->second<<'\n';
    return 0;
}
int compr(int v)
{
    if(t[v]==v)
        return v;
    t[v]=compr(t[v]);
    return t[v];
}