#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const ll INF = 1e17;


ll N, M;
vector<ll> W;
vector<pair<ll,ll>> A; //A[i] := first以下の耐荷重を持つものの最大の長さ

// #include"debug.hpp"

ll calc(ll weight) {
    auto girigiri = upper_bound(A.begin(), A.end(), pair<ll,ll>{weight, -INF});
    if(girigiri == A.begin()) {
        return 0;
    }
    girigiri--;
    if(girigiri -> first > weight) {
        return INF;
    }
    return girigiri -> second;
}


int main()
{
    cin >> N >> M;
    W.resize(N), A.resize(M);
    for(ll i = 0; i < N; i++)cin >> W[i];
    for(ll i = 0; i < M; i++)cin >> A[i].second >> A[i].first;
    sort(W.begin(), W.end());
    sort(A.begin(), A.end());
    
    // /*
    {
        ll maxweight = W.back();
        for(int i = 0; i < M; i++) {
            if(A[i].first < maxweight) {
                cout << -1 << endl;
                return 0;
            }
        }
    }
    // */


    for(ll i = 1; i < M; i++) {
        A[i].second = max(A[i].second, A[i - 1].second);
    }

    // print(A);

    ll answer = 1e17;


    do {
        
        vector<vector<ll>> hen(N);
        for(ll i = 0; i < N; i++) {
            for(ll j = i + 1; j < N; j++) {
                ll sum = 0;
                for(ll k = i; k <= j; k++)sum += W[k];
                // print(sum);
                ll len = calc(sum); //重さsumを乗せれる最小の長さ
                hen[i].push_back(len);
            }
        }



        vector<ll> dist(N);
        for(ll i = 0; i < N; i++) {
            for(ll j = i + 1; j < N; j++) {
                dist[j] = max(dist[j], dist[i] + hen[i][j - i - 1]);
            }
        }
        answer = min(answer, dist[N - 1]);


    } while(next_permutation(W.begin(), W.end()));

    if(answer == INF) {
        cout << -1 << endl;
        return 0;
    }
    cout << answer << endl;

}
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
constexpr ll INF = numeric_limits<ll>::max()/4;
constexpr ll n_max = 2e5+10;
#define int ll
const long double pi = 3.14159265358979323846;

template <typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string &s) {return '"' + s + '"';}
string to_string(const char *c) {return to_string((string) c);}
string to_string(bool b) {return (b ? "true" : "false");}
template <size_t N>
string to_string(bitset<N> v){
    string res = "";
    for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);
    return res;
}
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for(const auto &x : v) {
        if(!first) res += ", ";
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}

void debug_out() {cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}

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

template<class T>
bool chmax(T &a, T b){if(a < b){a = b; return true;} return false;}
template<class T>
bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;}

template <typename T>
struct UnionFind {
   private:
    vector<T> par;
    vector<T> rank;
    vector<T> sz;
    vector<T> a, b;
    int n;

   public:
    // n要素で親を初期化、par[x]はxの親を表す
    UnionFind(int n) : n(n) {
        par.resize(n, 0);
        rank.resize(n, 0);
        sz.resize(n, 1);
        a.resize(n);
        b.resize(n);
        for (int i = 0; i < n; i++) {
            par[i] = i;
        }
    }

    void init(vector<ll> &A, vector<ll> &B){
        rep(i,0,n){
            a[i] = A[i];
            b[i] = B[i];
        }
    }
    //木の根を求める
    int root(int x) {
        if (par[x] == x)
            return x;
        else
            return par[x] = root(par[x]);
    }

    // xとyの属する集合を併合
    void unite(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return;

        if (rank[x] < rank[y]) {
            swap(x, y);
        }

        par[y] = x;
        sz[x] += sz[y];
        a[x] += a[y];
        b[x] += b[y];
        if (rank[x] == rank[y]) rank[x]++;
    }

    // xとyが同じ集合に属するか否か
    bool issame(int x, int y) {
        return root(x) == root(y);
    }

    // xが属する集合のサイズを返す
    int size(int x) {
        return sz[root(x)];
    }

    // 集合の数を返す
    int num_of_s() {
        vector<int> cnt(n);
        int ans = 0;
        for (int i = 0; i < n; i++) {
            if (!cnt[root(i)]) ans++, cnt[root(i)] = 1;
        }
        return ans;
    }
    T get_a(int k){
        return a[root(k)];
    }
    T get_b(int k){
        return b[root(k)];
    }
};
void YES(bool ok){
    cout << (ok ? "Yes" : "No") << endl;
}
signed main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,m;
    cin >> n >> m;
    vector<ll> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    vector<ll> b(n);
    for(int i = 0; i < n; i++) cin >> b[i];

    UnionFind<ll> uf(n);
    uf.init(a, b);
    rep(i,0,m){
        ll u,v; cin >> u >> v;
        u--;
        v--;
        uf.unite(u, v);
    }

    bool ok = true;
    rep(i,0,n){
        ok &= uf.get_a(i) == uf.get_b(i);
    }

    YES(ok);
}