#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

vi G[MAX];
int A[MAX],B[MAX];
int K;

void solve(int u,int p){
    for(int to:G[u]){
        if(to==p) continue;
        solve(to,u);
        int z=(B[to]-A[to]+K)%K;
        A[u]+=z;
        A[u]%=K;
    }
}
int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        int N,M;cin>>N>>M>>K;
        for(int i=0;i<N;i++){
            G[i].clear();
        }
        for(int i=0;i<N-1;i++){
            int a,b;cin>>a>>b;a--;b--;
            G[a].pb(b);
            G[b].pb(a);
        }
        for(int i=0;i<N;i++){
            A[i]=0;
            cin>>B[i];
        }
        solve(0,-1);
        if(A[0]==B[0]) cout<<"Yes\n";
        else cout<<"No\n";
    }
    
}