B.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);

const ll sz = 2e5 + 10;
vector <ll> g[sz];
ll a[sz], b[sz], asum, bsum;
bool vis[sz];

void dfs(ll u)
{
    vis[u] = 1, asum += a[u], bsum += b[u];

    for(ll &v : g[u]) {
        if(!vis[v])
            dfs(v);
    }
}

int main()
{
    ll n, m;
    cin >> n >> m;

    for1(i, n) sl(a[i]);
    for1(i, n) sl(b[i]);

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

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

    bool state = 1;

    for1(i, n) {
        if(vis[i])
            continue;

        asum = 0, bsum = 0;
        dfs(i);

        if(asum != bsum) {
            state = 0;
            break;
        }
    }

    if(state) cout << "Yes" << EL;
    else cout << "No" << EL;

    return 0;
}