F.cpp

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

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

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define inf (1LL << 61)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define for0(i, stop) for(ll i = 0; i < stop; ++i)
#define rep1(i, start) for(ll i = start; i >= 1; --i)
#define rep0(i, start) for(ll i = (start-1); i >= 0; --i)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

// === DEBUG MACRO STARTS HERE === //
#ifndef ONLINE_JUDGE
#define DEBUG
#define SYS_COL system("COLOR")
#endif

int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) {++recur_depth; auto x_=x; --recur_depth; SYS_COL; \
                cerr<<string(recur_depth, '\t')<<"\e[91m"<<__func__<<":" \
                <<__LINE__<<"\t"<<#x<<" = "<<x_<<"\e[39m"<<endl;}

template<typename Ostream, typename Cont>
typename enable_if<is_same<Ostream,ostream>::value,
            Ostream&>::type operator<<(Ostream& os,  const Cont& v) {
	os<<"[";
	for(auto& x:v){os<<x<<", ";}
	return os<<"]";
}
template<typename Ostream, typename ...Ts>
Ostream& operator<<(Ostream& os,  const pair<Ts...>& p){
	return os<<"{"<<p.first<<", "<<p.second<<"}";
}
#else
#define dbg(x)
#endif
// === DEBUG MACRO ENDS HERE === //

#define ff first
#define ss second

const ll sz = 2e5 + 10;
vector <ll> g[sz];
ll col[sz], val[sz], tar[sz];

ll bipartite(ll n)
{
    for1(i, n) col[i] = -1;
    ll dif0 = 0, dif1 = 0;

    queue <ll> q;
    q.push(1);
    col[1] = 0, dif0 += (tar[1] - val[1]);

    while(!q.empty()) {
        ll u = q.front();
        q.pop();

        for(ll &v : g[u]) {
            if(col[v] != -1) {
                if(col[v] == col[u])
                    return 0;
                continue;
            }

            col[v] = col[u]^1;
            q.push(v);

            if(col[v] == 0) dif0 += (tar[v] - val[v]);
            else dif1 += (tar[v] - val[v]);
        }
    }

    if(dif0 == dif1) return 1;
    else return -1;
}

int main()
{
    ll t;
    cin >> t;

    while(t--) {
        ll n, m;
        sl(n), sl(m);

        for1(i, n) sl(val[i]);
        for1(i, n) sl(tar[i]);

        for1(i, n) g[i].clear();

        for1(i, m) {
            ll u, v;
            sl(u), sl(v);

            g[u].pb(v);
            g[v].pb(u);
        }

        ll sumv = 0, sumt = 0;
        for1(i, n) sumv += val[i], sumt += tar[i];

        if((sumv&1) != (sumt&1)) {
            pf("NO\n");
            continue;
        }

        ll status = bipartite(n);
        if(status >= 0) pf("YES\n");
        else pf("NO\n");
    }

    return 0;
}