#include <fstream>
#include <vector>
#include <queue>
#include <tuple>

using namespace std;

ifstream be("apm.in");
ofstream ki("apm.out");

int main()
{
    int n, m;
    be >> n >> m;

    vector<vector<pair<int, int>>> e(n + 1);
    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> pq;

    for(int i = 0; i < m; i++)
    {
        int x, y, c;
        be >> x >> y >> c;

        e[x].push_back({y, c});
        e[y].push_back({x, c});

        if(x == 1)
        {
            pq.push({c, x, y});
        }else if(y == 1)
        {
            pq.push({c, y, x});
        }
    }

    vector<char> vis(n + 1);
    vis[1] = 1;

    vector<pair<int, int>> ans;

    int sum = 0;

    while(!pq.empty())
    {
        int x = get<1>(pq.top());
        int y = get<2>(pq.top());
        int c = get<0>(pq.top());
        pq.pop();

        if(!vis[y])
        {
            ans.push_back({x, y});
            sum += c;
            vis[y] = 1;

            for(pair<int, int> j : e[y])
            {
                if(!vis[j.first])
                {
                    pq.push({j.second, y, j.first});
                }
            }
        }
    }

    ki << sum << "\n" << ans.size() << "\n";

    for(pair<int, int> i : ans)
    {
        ki << i.first << " " << i.second << "\n";
    }

    return 0;
}