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

#define ll long long
#define ull unsigned long long
#define ld  long double

using LL = long long; using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>;
using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>;
using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>;
using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>;
using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>;
using MII = map<int,int>; using MLL = map<LL,LL>;
using SI = set<int>; using SL = set<LL>;
using MSI = multiset<int>; using MSL = multiset<LL>;
template<class T> using MAXPQ = priority_queue<T>;
template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >;

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
#define PI  3.14159265358979323846

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(e, v) for(auto &e : v)
#define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it)
#define ALL(v) v.begin(),v.end()

vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1};
int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1};

/*
memo
-uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy
-isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv
nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10
-dijkstra,Floyd,bellmanford,sccd,topological,treediamiter
-compress1,compress2,rotate90

-co,ci,fo1,fo2,fo3,fo4
-bitsearch,binaryserach
-bfs
-SegTreedec,SegTreeLazydec
*/

void solve(){
    ll N,M,K; cin >> N >> M >> K;
    vector<set<ll>> G(N);
    for(ll i = 0; i < M; i++){
        ll u,v; cin >> u >> v;
        u--,v--;
        G[u].insert(v);
        G[v].insert(u);
    }
    VL b(N); for(ll i = 0; i < N; i++) cin >> b[i];

    queue<ll> q;
    set<ll> vis;
    for(ll i = 0; i < N; i++){
        if(G[i].size() == 1){
            q.push(i);
            vis.insert(i);
        }
    }
    VL cnt(N);
    while(q.size()){
        ll pos = q.front();q.pop();
        for(auto to : G[pos]){
            G[to].erase(pos);
            if(G[to].size() == 1 and !vis.count(to)){
                vis.insert(to);
                q.push(to);
            }
            ll need = 0;
            if(cnt[pos] <= b[pos]) need = b[pos] - cnt[pos];
            else need = b[pos] + K - cnt[pos];
            cnt[pos] = (cnt[pos]+need) % K;
            cnt[to] = (cnt[to]+need) % K;
        }
        G[pos].clear();
    }

    //for(ll i = 0; i < N; i++) cout << cnt[i] <<" ";
    //cout << '\n';

    if(cnt == b) cout << "Yes" << '\n';
    else cout << "No" << '\n';
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int t; cin >> t;
    while(t--){
        solve();
    }
    
    
}