#include<bits/stdc++.h>
using namespace std;
const int N=200005;
typedef long long LL;
int a[N],b[N],f[N],st[N],n,m,top;
long long sum[N][2];
inline int Find(int x){
    return x==f[x]?x:f[x]=Find(f[x]);
}
int main(void){
    cin>>n>>m;
    for(int i=1;i<=n;++i) f[i]=i;
	for(int i=1;i<=n;++i) cin>>a[i];
	for(int i=1;i<=n;++i) cin>>b[i];
	for(int i=1;i<=m;++i){
        int u,v;
        cin>>u>>v;
        int fu=Find(u);
        int fv=Find(v);
		if(fu==fv) continue;
		else f[fv]=fu;
    }
	for(int i=1;i<=n;++i) st[++top]=Find(i);
	sort(st+1,st+top+1);
    top=unique(st+1,st+top+1)-st-1;
	for(int i=1;i<=n;++i){
        int fa=lower_bound(st+1,st+1+top,Find(i))-st;
        sum[fa][0]+=a[i];
        sum[fa][1]+=b[i];
    }
	int flag=1;
    for(int i=1;i<=top;++i){
        if(sum[i][0]!=sum[i][1]){
            flag=0;
            break;
        }
    }
	if(flag==1) cout<<"Yes";
	else cout<<"No";
	return 0;
}
//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

vi adj[MX];
int N,M; 
vi a(MX),b(MX);

bool vis[MX];

pi p;

void dfs(int u){
	vis[u]=true;
	p.fi+=a[u]; p.se+=b[u];
	for(auto v: adj[u]) if(!vis[v]){
		dfs(v);
	}
}

int32_t main() {
	boost; IO();

	cin>>N>>M;
	
	FOR(i,1,N+1) cin>>a[i];
	FOR(i,1,N+1) cin>>b[i];

	FOR(i,0,M){
		int u,v; cin>>u>>v;
		adj[u].pb(v); adj[v].pb(u);
	}

	memset(vis,0,MX);
	FOR(i,1,N+1) if(!vis[i]){
		p={0,0};
		dfs(i);
		if(p.fi!=p.se){
			cout << "No" << endl;
			return 0;
		}
	}

	cout << "Yes" << endl;




	return 0;
}

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/
