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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

vi val, comp, z, cont;
int Time, ncomps;
template<class G, class F> int dfs(int j, G& g, F& f) {
	int low = val[j] = ++Time, x; z.push_back(j);
	for (auto e : g[j]) if (comp[e] < 0)
		low = min(low, val[e] ?: dfs(e,g,f));

	if (low == val[j]) {
		do {
			x = z.back(); z.pop_back();
			comp[x] = ncomps;
			cont.push_back(x);
		} while (x != j);
		f(cont); cont.clear();
		ncomps++;
	}
	return val[j] = low;
}
template<class G, class F> void scc(G& g, F f) {
	int n = sz(g);
	val.assign(n, 0); comp.assign(n, -1);
	Time = ncomps = 0;
	rep(i,0,n) if (comp[i] < 0) dfs(i, g, f);
}

void dfs(int now, vector<int> &vis, vector<int> &visord, vector<vector<pair<int, int>>> &adj) {
	vis[now] = 1;
	
	vector<int> o1, o2;
	for (auto [u, id]: adj[now]) {
		if (!vis[u]) {
			o1.push_back(id);
			dfs(u, vis, visord, adj);
		} else {
			o2.push_back(id);
		}
	}

	for (int i: o1) visord.push_back(i);
	for (int i: o2) visord.push_back(i);
}

void solve() {
	int n, m; cin >> n >> m;
	vector<int> scr(n+1);
	vector<int> bade, goode;
	vector<tuple<int, int, int, int>> ops;
	for (int i = 0; i < m; i++) {
		int u, x, v, y; cin >> u >> x >> v >> y;
		u--, v--;
		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;
		}
	}

	vector<vector<int>> g(n);
	vector<vector<pair<int, int>>> adj(n);
	int ptr = 0;
	for (auto [u, x, v, y]: ops) {
		if (x == 1 && y == 2) {
			if (scr[v]) {
				bade.push_back(ptr);
			} else {
				g[u].push_back(v);
				adj[u].emplace_back(v, ptr);
			}
		} else if (x == 2 && y == 1) {
			if (scr[u])  {
				bade.push_back(ptr);
			} else {
				g[v].push_back(u);
				adj[v].emplace_back(u, ptr);
			}
		}
		ptr++;
	}

	vector<int> tps;
	scc(g, [&](vi& v) {
		for (int i: v) tps.push_back(i);
	});

	reverse(tps.begin(), tps.end());
	vector<int> visord;
	vector<int> vis(n);
	for (int i: tps) {
		if (!vis[i]) {
			dfs(i, vis, visord, adj);
		}
	}

	//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);
	for (int i: ans) {
		auto [u, x, v, y] = ops[i];
		fl[u] = x; fl[v] = y;
	}

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

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

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

	return 0;
}