#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) a.begin(),a.end()
#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) reps(i, 0, n)
#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;

ll myceil(ll a, ll b) {return (a+b-1)/b;}

template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using vvv = vv<vc<T>>;

using pii = pair<int,int>;
using pll = pair<ll,ll>;

template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }

#define debug(var) do { cout << #var << " :\n"; view(var); } while(0)
template<typename T>void view(const T& e) {cout << e;}
template<typename T1, typename T2>void view(const pair<T1, T2>& p) {cout << "{" << p.first << ", " << p.second << "}";}
template<typename T>void view(const vc<T>& v) {for (const auto& e : v) {view(e);cout << " ";} cout << endl;}
template<typename T>void view(const vv<T>& vv) {for (const auto& v : vv) {view(v);} cout << endl;}
template<typename T>void view(const set<T>& s) {for (const auto& e : s) {view(e);cout << " ";} cout << endl;}
template<typename T>void view(const multiset<T>& s) {for (const auto& e : s) {view(e);cout << " ";} cout << endl;}
template<typename T>void view(const unordered_set<T>& s) {for (const auto& e : s) {view(e);cout << " ";} cout << endl;}
template<typename T>void view(const unordered_multiset<T>& s) {for (const auto& e : s) {view(e);cout << " ";} cout << endl;}
template<typename T1, typename T2>void view(const map<T1, T2>& mp){for (const auto& e : mp) {view(e);cout << " ";} cout << endl;}


// # pragma GCC target("avx2")
// # pragma GCC optimize("O3")
// # pragma GCC optimize("unroll-loops")

// #include <atcoder/all>
// using namespace atcoder;



void solve() {
    ll n,m,k;
    cin >> n >> m >> k;
    vector<int> u(m), v(m);
    rep(i,m) {
        cin >> u[i] >> v[i];
        u[i]--; v[i]--;
    }

    vector<ll> b(n);
    rep(i,n) cin >> b[i];

    vector<vector<int>> g(n);
    rep(i,m) {
        g[u[i]].push_back(v[i]);
        g[v[i]].push_back(u[i]);
    }

    ll even = 0;
    ll odd = 0;

    queue<pair<ll,ll>> que;
    que.push({0,0});
    
    vector<int> visit(n,-1);
    visit[0] = 1;
    
    while (!que.empty()) {
        auto [p,q] = que.front();
        que.pop();

        if (q%2) {
            even += b[p];
        }
        else {
            odd += b[p];
        }

        for (auto x : g[p]) {
            if (visit[x] < 0) {
                visit[x] = 1;
                que.push({x,q+1});
            }
        }
    }

    if (odd%k == even%k) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
    return;
}


int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int t = 1;
    cin >> t;
    rep(i,t)  solve();

	return 0;
}