#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; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, m, k; cin >> n >> m >> k;
		vector to(n, vector<int>());
		rep(i, m) {
			int u, v; cin >> u >> v;
			u--, v--;
			to[u].push_back(v);
			to[v].push_back(u);
		}
		vector<int>a(n), b(n);
		rep(i, n)cin >> b[i];
		auto dfs = [&](auto &&self, int v, int p = -1)->int {
			for (auto nv : to[v]) {
				if (p == nv)continue;
				auto get = self(self, nv, v);
				a[v] += get;
				a[v] %= k;
			}
			int ret = 0;
			if (a[v] > b[v])ret = b[v] + k - a[v];
			else ret = b[v] - a[v];
			a[v] = b[v];
			return ret;
		};
		auto res = dfs(dfs, 0);
		cout << (res == 0 ? "Yes" : "No") << endl;
	}
	return 0;
}