#include <bits/stdc++.h>
using namespace std;

#define int long long
const int INF = 1e18;

void solve() {
	int n, m; cin >> n >> m;
	vector<vector<pair<int, int>>> adj(n+1);
	vector<int> scr(n+1);
	vector<int> bade, goode;
	vector<tuple<int, int, int, int>> ops;
	for (int i = 1; i <= m; i++) {
		int u, x, v, y; cin >> u >> x >> v >> y;
		ops.emplace_back(u, x, v, y);
		if (x == 1 && y == 1) {
			bade.push_back(i);
		} else if (x == 2 && y == 2) {
			goode.push_back(i);
			scr[u] = scr[v] = 1;
		} else {
			if (x == 2) {
				swap(u, v);
			}
			adj[x].emplace_back(y, i);
		}
	}

	vector<int> visord;
	vector<int> indeg(n+1);
	for (int i = 1; i <= n; i++) {
		for (auto [j, id]: adj[i]) {
			indeg[j]++;
		}
	}

	vector<int> seen(n+1);
	set<pair<int, int>> cands;
	for (int i = 1; i <= n; i++) {
		if (scr[i]) {
			cands.insert({-1, i});
		} else {
			cands.insert({indeg[i], i});
		}
	}

	for (int _ = 0; _ < n; _++) {
		auto [indg, u] = *cands.begin(); 
		seen[u] = 1; cands.erase(cands.begin());
		//cout << u << endl;

		for (auto [v, id]: adj[u]) {
			visord.push_back(id);
			if (scr[v]) continue;
			if (seen[v]) continue;
			cands.erase(cands.find({indeg[v], v}));
			indeg[v]--;
			cands.insert({indeg[v], v});
		}
	}
	reverse(visord.begin(), visord.end());

	// answer
	vector<int> ans;
	for (int i: bade) ans.push_back(i);
	for (int i: visord) ans.push_back(i);
	for (int i: goode) ans.push_back(i);

	vector<int> fl(n+1);
	for (int i: ans) {
		auto [u, x, v, y] = ops[i-1];
		fl[u] = x; fl[v] = y;
	}

	cout << accumulate(fl.begin(), fl.end(), 0LL) << '\n';
	for (int i: ans) cout << i << ' ';
		cout << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int t; cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}