/* -*- coding: utf-8 -*-
 *
 * 3425.cc:  No.3425 Mod K Graph Increments (Easy) - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

using vi = vector<int>;

/* global variables */

vi nbrs[MAX_N];
int bs[MAX_N], as[MAX_N];
int ps[MAX_N], cis[MAX_N];

/* subroutines */

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    int n, m, k;
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 0; i < n; i++) nbrs[i].clear();
    for (int i = 0; i < m; i++) {
      int u, v;
      scanf("%d%d", &u, &v);
      u--, v--;
      nbrs[u].push_back(v);
      nbrs[v].push_back(u);
    }
    for (int i = 0; i < n; i++) scanf("%d", bs + i);

    fill(as, as + n, 0);
    fill(cis, cis + n, 0);
    ps[0] = -1;

    for (int u = 0; u >= 0;) {
      auto &nbru = nbrs[u];
      int up = ps[u];

      if (cis[u] < nbru.size()) {
	int v = nbru[cis[u]++];
	if (v != up) {
	  ps[v] = u;
	  u = v;
	}
      }
      else {
	if (up >= 0) {
	  int d = (bs[u] - as[u] + k) % k;
	  as[up] = (as[up] + d) % k;
	}
	
	u = up;
      }
    }

    if (as[0] == bs[0]) puts("Yes");
    else puts("No");
  }

  return 0;
}