#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    int n, m, k; cin >> n >> m >> k;
    vvi adj(n);
    rep(i, m){
        int u, v; cin >> u >> v;
        u--; v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    vi vb(n); rep(i, n)cin >> vb[i];
    vi pa(n, -1), tmp(n, 0);
    queue<int> q; q.push(0); pa[0] = 0;
    while(!q.empty()){
        auto u = q.front(); q.pop();
        for(auto v : adj[u]){
            if(pa[v] != -1)continue;
            pa[v] = u;
            q.push(v);
            tmp[u]++;
        }
    }
    vi va(n, 0);
    rep(i, n){
        if(tmp[i] == 0)q.push(i);
    } 
    while(!q.empty()){
        auto u = q.front(); q.pop();
        int p = pa[u];
        if(vb[u] >= va[u]){
            int d = vb[u] - va[u];
            va[u] += d;
            va[p] += d; va[p] %= k;
        }else{
            int d = va[u] - vb[u];
            va[u] -= d;
            va[p] -= d; if(va[p] < 0)va[p] += k;
        }
        tmp[p]--;
        if(p == 0)continue;
        if(tmp[p] == 0)q.push(p);
    }
    cout << (va[0] == vb[0] ? "Yes" : "No") << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin >> t;
    while(t--)solve();

    return 0;
}