#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <tuple>
#include <numeric>
using namespace std;


int main(int argc, char* argv[]){
int N,M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
vector <pair<int,int>> P(M);

long long sum_a = 0;
long long sum_b = 0;
for(int i=0;i<N;i++){
	cin >> A[i];
	sum_a += A[i];
}
for(int i=0;i<N;i++){
	cin >> B[i];
	sum_b += B[i];
}
vector<int> num(N,0);
for(int i=0;i<M;i++){
	int c,d, tmp;
	cin >> c >> d;
	if(c>d){
		tmp = c;
		c = d;
		d = tmp;
	}
	num[c-1]++;
	num[d-1]++;
	P[i] = make_pair(c, d);
}
bool flag = true;
for(int i=0; i<N; i++){
	if(num[i]==0 && A[i]!=B[i]){
		flag = false;
	}
}

if(sum_a != sum_b || flag==false){
	cout << "No" << endl;
}else{
	cout << "Yes" << endl;
}

return 0;




}

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
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;}
 
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef ljuba
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
 
const char nl = '\n';

void solve() {
    vi v(4);
    for(auto &z : v)
        cin >> z;
    int sumica = accumulate(all(v), 0);
    for(int i = 1; i < (1<<4); ++i) {
        int suma = 0;
        for(int j = 0; j < 4; ++j) {
            if((i>>j)&1) {
                suma += v[j];
            }
        }
        if(suma * 2 == sumica) {
            cout << "Yes" << nl;
            return;
        }
    }

    cout << "No" << nl;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int testCases = 1;
    //cin >> testCases;
    while(testCases--)
        solve();
 
}
