#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct BipartiteGraphChecker {

	BipartiteGraphChecker(int n) :n(n) {
		col.assign(n, -1);
		graph.resize(n);
	}

	void add_edge(int u, int v) {
		graph[u].push_back(v);
		graph[v].push_back(u);
	}
	int n;
	std::vector<std::vector< int >> graph;
	std::vector<int>col;

	bool solve(int  v, int p = -1) {
		if (-1 == p)col[v] = 0;
		bool ret = true;
		for (auto e : graph[v]) {
			if (-1 != col[e]) {
				if (1 != col[e] + col[v])ret = false;
			}
			else {
				col[e] = 1 - col[v];
				ret &= solve(e, v);
			}
		}
		return ret;
	}
	bool solverAll() {
		bool chk = true;
		for (int i = 0; i < n; ++i) {
			if (-1 != col[i])continue;
			auto get = solve(i);
			if (!get)chk = false;
		}
		return chk;
	}
};
void solve() {
	int n, m, k; cin >> n >> m >> k;
	BipartiteGraphChecker bgc(n);
	vector to(n, vector<int>());
	rep(i, m) {
		int u, v; cin >> u >> v;
		u--, v--;
		bgc.add_edge(u, v);
	}
	vector<int>b(n);
	rep(i, n)cin >> b[i];
	bool chk = bgc.solve(0);
	long long c0 = 0, c1 = 0;
	rep(i, n) {
		if (bgc.col[i] == 0)c0 += b[i];
		else c1 += b[i];
	}
	c0 %= k;
	c1 %= k;

	if (!chk) {
		int d = abs(c0 - c1);
		if (k % 2)cout << "Yes" << endl;
		else {
			if (d % 2)cout << "No" << endl;
			else cout << "Yes" << endl;
		}
		return;
	}
	cout << (c0 == c1 ? "Yes" : "No") << endl;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--)solve();
	return 0;
}