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

void solve(){
  int n,m,k;
  cin>>n>>m>>k;
  vector<vector<int>> g(n);
  for (int i=0;i<m;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  vector<int> b(n);
  for (int i=0;i<n;i++) cin>>b[i];
  vector<int> a(n);
  vector<int> dep(n);
  auto dfs=[&](auto dfs,int v,int par)-> void {
    for (int u:g[v]){
      if (u==par) continue;
      dep[u]=dep[v]+1;
      dfs(dfs,u,v);
      int r=(b[u]+k-a[u])%k;
      a[u]=(a[u]+r)%k;
      a[v]=(a[v]+r)%k;
    }
  };
  dfs(dfs,0,-1);
  int s0=0,s1=0;
  for (int i=0;i<n;i++){
    if (dep[i]%2==0) s0=(s0+b[i])%k;
    else s1=(s1+b[i])%k;
  }
  assert((s0==s1)==(b[0]==a[0]));
  if (b[0]==a[0]) cout<<"Yes\n";
  else cout<<"No\n";
}

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