#include <bits/stdc++.h>

using i64 = long long;

void solve() {
	int n, m;
	std::cin >> n >> m;
	
	std::vector<int> a(m), b(m), c(m);
	for (int i = 0; i < m; i ++ ) {
		std::cin >> a[i] >> b[i] >> c[i];
		a[i] --, b[i] -- ;
	}
	
	std::vector<int> d(n);
	for (int i = 0; i < n; i ++ ) {
		std::cin >> d[i];
	}
	for (int i = 0; i < m; i ++ ) {
		if (d[a[i]] == d[b[i]] && c[i] != d[a[i]]) {
			std::cout << "NO\n";
			return;
		}
	}

	std::vector<int> deg(n);
	std::vector<std::vector<int>> adj(n);
	std::vector<std::vector<std::pair<int, int>>> egs(n);
	for (int i = 0; i < m; i ++ ) {
		if (d[a[i]] == d[b[i]]) {
			continue;
		}
		egs[a[i]].emplace_back(b[i], c[i]);
		egs[b[i]].emplace_back(a[i], c[i]);
	}
	
	std::vector<int> change(n);
	for (int i = 0; i < n; i ++ ) {
		bool ok = 1;
		for (auto j : egs[i]) {
			if (j.second && !d[i]) {
				ok = 0;
				break;
			}
		}
		if (!ok) {
			change[i] = 1;
			for (auto j : egs[i]) {
				if (j.second != d[i] ^ 1) {
					change[j.first] = 1;
				}
			}
		}
	}
	for (int i = 0; i < n; i ++ ) {
		if (!change[i]) {
			continue;
		}
		for (auto j : egs[i]) {
			if (j.second != d[i] ^ 1) {
				adj[j.first].push_back(i);
				deg[i] ++ ;
			}
		}
	}

	std::queue<int> q;
	for (int i = 0; i < n; i ++ ) {
		if (!deg[i]) {
			q.push(i);
		}
	}
	std::vector<int> top;
	while (!q.empty()) {
		int x = q.front();
		q.pop();
		top.push_back(x);
		for (auto y : adj[x]) {
			if ( -- deg[y] == 0) {
				q.push(y);
			}
		}
	}
	
	if (top.size() != n) {
		std::cout << "NO\n";
		return;
	}
	
	std::cout << "YES\n";
	std::reverse(top.begin(), top.end());
	std::vector<std::pair<int, int>> seq;
	for (int i = 0; i < n; i ++ ) {
		if (d[i]) {
			seq.emplace_back(i, 1);
		}
	}
	for (int i = 0; i < n; i ++ ) {
		if (change[top[i]]) {
			seq.emplace_back(top[i], d[top[i]] ^ 1);
			seq.emplace_back(top[i], d[top[i]]);
		}
	}

	std::cout << seq.size() << "\n";
	for (auto op : seq) {
		std::cout << op.first + 1 << " " << op.second << "\n";
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	
	int t;
	std::cin >> t;
	
	while (t -- ) {
		solve();
	}

	return 0;
}