#include<bits/stdc++.h>
namespace {
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;


struct V {
  int x, y, p;
  bool operator<(const V& rhs) {
    return x < rhs.x || (x == rhs.x && y < rhs.y);
  }
};

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI p(n);
  rep(i, n) cin >> p[i];
  VI a(n), b(n), c(m), d(m);
  rep(i, n) cin >> a[i] >> b[i];
  rep(i, m) cin >> c[i] >> d[i];
  int ans = 0;
  vector<V> vs;
  vs.reserve(n * m);
  rep(_, 2) {
    rep(_, 2) {
      rep(i, n) rep(j, m) vs.push_back({c[j] - a[i], d[j] - b[i], p[i]});
      sort(all(vs));
      const int sz = n * m;
      for(int i = 0; i < sz;) {
        int j = i + 1;
        while(j < sz && vs[j].x == vs[i].x && vs[j].y == vs[i].y) j++;
        int s = 0;
        while(i < j) s += vs[i++].p;
        chmax(ans, s);
      }
      for(int& x: c) x = - x;
      vs.clear();
    }
    for(int& y: d) y = -y;
  }
  cout << ans << '\n';
}