#line 1 "main_b.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <utility>
#include <vector>

/* template start */

using i64 = std::int_fast64_t;
using u64 = std::uint_fast64_t;

#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()

#ifdef LOCAL
#define debug(...)                                                    \
  std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
      debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() { std::cerr << std::endl; }

template <typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
  std::cerr << " " << h;
  if (sizeof...(t) > 0) std::cout << " :";
  debug_out(t...);
}

template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  return a > b && (a = b, true);
}

template <typename Num>
constexpr Num mypow(Num a, u64 b, Num id = 1) {
  if (b == 0) return id;
  Num x = id;
  while (b > 0) {
    if (b & 1) x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}

template <typename T>
std::vector<std::pair<std::size_t, T>> enumerate(const std::vector<T>& data) {
  std::vector<std::pair<std::size_t, T>> ret;
  for (std::size_t index = 0; index < data.size(); index++)
    ret.emplace_back(index, data[index]);
  return ret;
}

/* template end */

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  i64 n,m;
  std::cin>>n>>m;

  std::vector<i64> a(n),b(n);
  for(auto&& e:a)std::cin>>e;
  for(auto&& e:b)std::cin>>e;

  std::vector<std::vector<i64>> graph(n);
  rep(i,0,m){
    i64 c,d;
    std::cin>>c>>d;
    c--;d--;
    graph[c].emplace_back(d);
    graph[d].emplace_back(c);
  }

  std::vector<bool> visit(n,false);

  i64 aval=0,bval=0;

  auto dfs=[&](auto f,i64 now)->void{
    visit[now]=true;
    aval += a[now];
    bval += b[now];
    for(const auto& e:graph[now]){
      if(!visit[e])f(f,e);
    }
  };

  rep(i,0,n){
    if(!visit[i]){
      aval = 0;
      bval = 0;
      dfs(dfs,i);
      if(aval!=bval){
        std::cout<<"No\n";
        return 0;
      }
    }
  }

  std::cout<<"Yes\n";

  return 0;
}

//#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

#include <bits/stdc++.h>

#ifdef LOCAL
#include "debug-template.hpp"
#endif

using namespace std;

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, m; cin >> n >> m;
	vector<int> a(n), b(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
	}
	vector<int> f(n);
	iota(f.begin(), f.end(), 0);
	vector<long long> g(n);
	for (int i = 0; i < n; i++) {
		g[i] = a[i] - b[i];
	}
	function<int(int)> find_set = [&](int u) {
		return f[u] == u ? f[u] = u : f[u] = find_set(f[u]);
	};
	for (int i = 0; i < m; i++) {
		int u, v; cin >> u >> v;
		u--, v--;
		u = find_set(u);
		v = find_set(v);
		if (u != v) {
			g[v] += g[u];
			g[u] = 0;
			f[u] = v;
		}
	}
	for (int i = 0; i < n; i++) {
		if (g[i]) {
			cout << "No\n";
			return 0;
		}
	}
	cout << "Yes\n";
	return 0;
}
