#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

bool solve() {
  int n, m, k;
  cin >> n >> m >> k;
  dsu uf(2 * n);
  rep(_, m) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    uf.merge(u, v + n);
    uf.merge(v, u + n);
  }
  VI b(n);
  rep(i, n) cin >> b[i];
  if (!uf.same(0, n)) {
    int now = 0;
    rep(i, n) {
      now += uf.same(i, 0) ? b[i] : -b[i];
      now %= k;
    }
    return now == 0;
  }
  if (k % 2) return true;
  return accumulate(all(b), 0LL) % 2 == 0;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    cout << (solve() ? "Yes\n" : "No\n");
  }
}