#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define x first
#define y second
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int i,j,d[200010],n,m,a,b,now,z,p,c;
long long int s;
vector <pair<int,pair<int,int> > > v;
queue <pair<int,int> > q;
int parinte(int x)
{
    if(d[x]==x)
        return x;
    return parinte(d[x]);
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
        fin>>a>>b>>c,v.push_back(make_pair(c,make_pair(a,b)));
    sort(v.begin(),v.end());
    for(i=1;i<=n;i++)
        d[i]=i;
    for(i=0;i<m;i++)
    {
        a=parinte(d[v[i].y.x]);
        b=parinte(d[v[i].y.y]);
        if(a!=b)
        {
            if(a>b)
                d[a]=b;
            else
                d[b]=a;
            s+=v[i].x;
            q.push(v[i].y);
        }
    }
    fout<<s<<" "<<q.size()<<'\n';
   while(!q.empty())
   {
       fout<<q.front().x<<" "<<q.front().y<<'\n';
       q.pop();
   }
    return 0;
}