#include<stdio.h>
long long int u[400005], v[400005];
int h[400005], l;
long long int comp_h(long long int a, long long int b)
{
	if (h[a] > h[b])
		return 1;
	else
		return -1;
}
void swap_h(long long int a, long long int b)
{
	long long int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(long long int ne)
{
	h[l] = ne;
	long long int p = l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
long long int pop()
{
	swap_h(0, --l);
	long long int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
long long int b[200005];
long long int id[400005];
long long int col[200005];
void solve()
{
	long long int n, m, k;
	scanf("%lld %lld %lld", &n, &m, &k);
	long long int i;
	for (i = 0; i < m; i++)
	{
		scanf("%lld %lld", &u[i], &v[i]);
		u[i + m] = --v[i];
		v[i + m] = --u[i];
	}
	for (i = 0; i < n; i++)
		scanf("%lld", &b[i]);
	m *= 2;
	l = 0;
	for (i = 0; i < m; i++)
		push(i);
	for (i = 0; i < m; i++)
		id[i] = pop();
	id[m] = m;
	u[m] = -1;
	long long int min, mid, max;
	for (i = 0; i < n; i++)
		col[i] = -1;
	long long int f = 0;
	col[0] = 0;
	h[0] = 0;
	l = 1;
	while (l > 0)
	{
		i = h[--l];
		min = -1;
		max = m;
		while (max - min > 1)
		{
			mid = (max + min) / 2;
			if (u[id[mid]] < i)
				min = mid;
			else
				max = mid;
		}
		for (; u[id[max]] == i; max++)
		{
			if (col[v[id[max]]] < 0)
			{
				col[v[id[max]]] = 1 - col[i];
				h[l++] = v[id[max]];
			}
			if (col[v[id[max]]] == col[i])
				f = 1;
		}
	}
	long long int sum[2] = { 0,0 };
	if (f > 0)
	{
		for (i = 0; i < n; i++)
			sum[0] = (sum[0] + b[i]) % 2;
		if (k % 2 == 0)
		{
			if (sum[0] > 0)
				printf("No\n");
			else
				printf("Yes\n");
		}
		else
			printf("Yes\n");
	}
	else
	{
		for (i = 0; i < n; i++)
			sum[col[i]] += b[i];
		if (sum[0] % k == sum[1] % k)
			printf("Yes\n");
		else
			printf("No\n");
	}
	return;
}
int main()
{
	int t;
	scanf("%d", &t);
	for (; t > 0; t--)
		solve();
	return 0;
}