#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    int n, m; cin >> n >> m;
    ll k; cin >> k;
    vector<vector<int>> G(n);
    for(int i=0; i<m; i++){
        int u, v; cin >> u >> v;
        u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    vector<ll> b(n); for(int i=0; i<n; i++) cin >> b[i];
    if(k%2 == 0){
        ll sumB = 0LL; for(int i=0; i<n; i++) sumB += b[i];
        if(sumB%2 == 1){
            cout << "No\n";
            return;
        }
    }
    
    vector<int> c(n, -1);
    bool is_bipartite = true;
    function<void(int)> bipartite_coloring = [&](int v){
        for(int to : G[v]){
            if(c[to] == -1){
                c[to] = 1 - c[v];
                bipartite_coloring(to);
            }else if(c[to] == c[v]){
                is_bipartite = false;
            }
        }
    };
    c[0] = 0; bipartite_coloring(0);
    if(!is_bipartite){
        cout << "Yes\n";
        return;
    }

    vector<ll> sum(2, 0LL);
    for(int i=0; i<n; i++) sum[c[i]] += b[i];
    if(sum[0]%k == sum[1]%k) cout << "Yes\n";
    else cout << "No\n";
}

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