#include <bits/stdc++.h>
#define pb push_back

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;

const int DMAX = 1e5+10;

struct nume{
    int x,y,c;
};

vector <pii> vec;
priority_queue <nume> heap;

int tata[DMAX];

int n,m;
int ans;

inline bool operator<(nume x,nume y){
    return x.c>y.c;
}

int findd(int node);
void unire(int x,int y);

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t,i,j;
    int x,y,z;

    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>z;
        heap.push({x,y,z});
    }
    for(i=1;i<n;){
        nume node=heap.top();
        heap.pop();
        if(findd(node.x) != findd(node.y)){
            ans+=node.c;
            i++;
            unire(node.x,node.y);
            vec.pb({node.x,node.y});
        }
    }
    fout<<ans<<'\n';
    fout<<n-1<<'\n';
    for(auto& it:vec)
        fout<<it.first<<' '<<it.second<<'\n';

    return 0;
}
int findd(int node){
    int ans=node,aux;
    while(tata[ans])
        ans=tata[ans];
    while(tata[node]){
        aux=node;
        node=tata[node];
        tata[aux]=ans;
    }
    return ans;
}
void unire(int x,int y){
    x=findd(x);
    y=findd(y);
    tata[x]=y;
}