class UnionFind:
    def __init__(self,N):
        self.parent = [i for i in range(N)]
        self._size = [1] * N
        self.count = 0
    def root(self,a):
        if self.parent[a] == a:
            return a
        else:
            self.parent[a] = self.root(self.parent[a])
            return self.parent[a]
    def is_same(self,a,b):
        return self.root(a) == self.root(b)
    def unite(self,a,b):
        ra = self.root(a)
        rb = self.root(b)
        if ra == rb: return
        if self._size[ra] < self._size[rb]: ra,rb = rb,ra
        self._size[ra] += self._size[rb]
        self.parent[rb] = ra
        self.count += 1
    def size(self,a):
        return self._size[self.root(a)]


import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)

def solve(N,M,K,UV,B):
    es = [[] for _ in range(N)]
    for u,v in UV:
        u,v = u-1,v-1
        es[u].append(v)
        es[v].append(u)
    
    if M==N-1:
        A = [0] * N
        def rec(v,p=-1):
            for to in es[v]:
                if to==p: continue
                A[v] += rec(to,v)
                A[v] %= K
            ret = (B[v] - A[v]) % K
            return ret
        rec(0)
        return 'Yes' if A[0]==B[0] else 'No'
    
    ST = [[] for _ in range(N)]
    rem = []
    uf = UnionFind(N)
    for u,v in UV:
        u,v = u-1,v-1
        if uf.is_same(u,v):
            rem.append((u,v))
        else:
            uf.unite(u,v)
            ST[u].append(v)
            ST[v].append(u)
    
    costs = [0] * N
    costs[0] = B[0]
    visited = [0] * N
    visited[0] = 1
    stack = [0]
    while stack:
        v = stack.pop()
        for to in ST[v]:
            if visited[to]: continue
            visited[to] = 1
            costs[to] = costs[v] + B[to]
            stack.append(to)
    for u,v in rem:
        if (costs[u] + costs[v]) % 2:
            return 'No'
    return 'Yes'
    


T = int(input())
for _ in range(T):
    N,M,K = map(int,input().split())
    UV = [tuple(map(int,input().split())) for _ in range(M)]
    B = list(map(int,input().split()))
    print(solve(N,M,K,UV,B))