#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n, m, dsu[210];
vector <pair< pair<int, int>, pair<int, int> > > vec;
vector <pair<int, int> > ans;
int dsu_get(int v){
if (dsu[v] == v)
return v;
return dsu[v] = dsu_get(dsu[v]);
}
int dsu_connct(int a, int b){
int aa = a, bb = b;
a = dsu_get(a);
b = dsu_get(b);
if (a == b)
return 0;
dsu[b] = a;
return 1;
}
bool cmp(pair<pair<int, int>, pair<int, int> > fi, pair<pair<int, int>, pair<int, int> > se){
return (max(fi.first.first, fi.first.second) < max(se.first.first, se.first.second));
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
for (int i = 0; i <= n; i++)
dsu[i] = i;
for (int i = 1; i <= m; i++){
int a, b, c, d;
cin >> a >> b >> c >> d;
vec.push_back({{c, d}, {a, b}});
}
int ans1 = 0, ans2 = 0;
sort(vec.begin(), vec.end(), cmp);
for (int i = 0; i < vec.size(); i++){
int a = vec[i].second.first, b = vec[i].second.second, c = vec[i].first.first, d = vec[i].first.second;
if (dsu_connct(a, b) == 1){
ans.push_back({a, b});
ans1 += c;
ans2 += d;
}
}
cout << ans1 << ' ' << ans2 << endl;
for (int i = 0; i < ans.size(); i++)
cout << ans[i].first << ' ' << ans[i].second << endl;
}
