#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template <class T> struct csr {
    using itr = typename std::vector<T>::iterator;
    struct Node {
        itr st, en;
        itr begin() { return st; }
        itr end() { return en; }
        int size() { return en - st; }
        T operator[](int p){ return st[p]; }
    };
    const int N;
    std::vector<int> start;
    std::vector<T> E;
    std::vector<std::pair<int,T>> edge;
    csr(int n) : N(n), start(n + 1) {}
    void add_edge(int u, T v){
        assert(0 <= u && u < N);
        start[u + 1]++;
        edge.emplace_back(u, v);
    }
    void build(){
        E.resize(edge.size());
        for(int i = 0; i < N; i++) start[i + 1] += start[i];
        auto cnt = start;
        for(auto [u, v] : edge) E[cnt[u]++] = v;
    }
    Node operator[](int p) {
        return Node{E.begin() + start[p], E.begin() + start[p + 1]};
    }
};

void solve(){
    int n, m, k;
    cin >> n >> m >> k;
    csr<int> g(n);
    for(int i = 0, u, v; i < m; i++){
        cin >> u >> v;
        u--, v--;
        g.add_edge(u, v);
        g.add_edge(v, u);
    }
    g.build();
    vector<int> a(n);
    for(auto &&v : a) cin >> v;
    array<ll, 2> s{};
    auto dfs = [&](auto dfs, int v, int p, int st) -> void {
        s[st] += a[v];
        for(auto u : g[v]){
            if(u == p) continue;
            dfs(dfs, u, v, st ^ 1);
        }
    };
    dfs(dfs, 0, -1, 0);
    cout << (s[0] % k == s[1] % k ? "Yes" : "No") << '\n';
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) solve();
}