import sys
from distutils.dir_util import remove_tree

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class UnionFind:
    def __init__(self, n):
        self._tree = [-1]*n
        # number of connected component
        self.cnt = n

    def root(self, u):
        stack = []
        while self._tree[u] >= 0:
            stack.append(u)
            u = self._tree[u]
        for v in stack: self._tree[v] = u
        return u

    def same(self, u, v):
        return self.root(u) == self.root(v)

    def merge(self, u, v):
        u, v = self.root(u), self.root(v)
        if u == v: return False
        if self._tree[u] > self._tree[v]: u, v = v, u
        self._tree[u] += self._tree[v]
        self._tree[v] = u
        self.cnt -= 1
        return True

    # size of connected component
    def size(self, u):
        return -self._tree[self.root(u)]

def ok():
    n,m,k=LI()
    uf=UnionFind(n)
    to=[[] for _ in range(n)]
    uv=[]
    for _ in range(m):
        u,v=LI1()
        if uf.merge(u,v):
            to[u].append(v)
            to[v].append(u)
        else:
            uv.append((u,v))
    bb=LI()

    def dfs(root=0):
        uu, stack = [], [root]
        while stack:
            u = stack.pop()
            uu.append(u)
            for v in to[u]:
                if v == parent[u]: continue
                parent[v] = u
                depth[v] = depth[u]+1
                stack.append(v)
        return uu

    parent, depth = [-1]*n, [0]*n
    uu = dfs()

    s=0
    for u in range(n):
        if depth[u]&1:
            s+=bb[u]
        else:
            s-=bb[u]
    s%=k

    if s==0:return True
    same=False
    for u,v in uv:
        if depth[u]&1==depth[v]&1:same=True
    if same and (k&1 or s&1):return True
    return False

for _ in range(II()):
    print("Yes" if ok() else "No")