#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#include <atcoder/dsu>
int main(){
	int ttt;
	cin>>ttt;
	while(ttt--){
		int n,m,k;
		cin>>n>>m>>k;
		vector<vector<int>> graph(n);
		atcoder::dsu uf(2*n);
		vector<ll> b(n);
		for(int i=0;i<m;i++){
			int u,v;
			cin>>u>>v;
			u--;v--;
			graph[u].push_back(v);
			graph[v].push_back(u);
			uf.merge(u,v+n);
			uf.merge(v,u+n);
		}
		for(int i=0;i<n;i++)cin>>b[i];
		if(uf.groups().size()==1){
			if(k%2){
				cout<<"Yes"<<endl;
			}else{
				ll sum=0;
				for(int i=0;i<n;i++)sum+=b[i];
				if(sum%2==0)cout<<"Yes"<<endl;
				else cout<<"No"<<endl;
			}
		}else{
			auto vv=uf.groups();
			ll sum=0;
			for(int i=0;i<n;i++){
				if(vv[0][i]<n)sum+=b[vv[0][i]];
				if(vv[1][i]<n)sum-=b[vv[1][i]];
			}
			if(sum%k==0)cout<<"Yes"<<endl;
			else cout<<"No"<<endl;
		}
	}
}