# include <bits/stdc++.h>
# define x0 first
# define y0 second
# define pii pair < int , int >
# define x x0
# define y y0.x0
# define z y0.y0
using namespace std;
const int nmax = 4e5 + 5;
ifstream fi("apm.in");
ofstream fo("apm.out");
bool cmp(pair < int , pii > a,pair < int , pii > b)
{
    return a.z < b.z;
}
pair < int , pii > s[nmax];
int v[nmax];
int find(int x)
{
    return (x == v[x] ? x:v[x] = find(v[x]));
}
vector < pii > ans;
int main(void)
{
    int n,m;
    fi>>n>>m;
    for (int i = 1;i <= m;++i) fi>>s[i].x>>s[i].y>>s[i].z;
    sort(s+1,s+1+m,cmp);
    for (int i = 1;i <= n;++i) v[i] = i;
    int sum = 0;
    for (int i = 1;i <= m;++i)
    {
        int a = find(s[i].x),b = find(s[i].y);
        if (a != b)
        {
            sum += s[i].z;
            ans.push_back(make_pair(s[i].x,s[i].y));
            v[b] = a;
        }
    }
    fo << sum << '\n' << n - 1 << '\n';
    for (int i = 0;i < n - 1;++i) fo << ans[i].x0 << ' ' << ans[i].y0 << '\n';
    return 0;
}