#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector<int> p(n), a(n), b(n), c(m), d(m);
  REP(i, n) cin >> p[i];
  REP(i, n) cin >> a[i] >> b[i];
  REP(i, m) cin >> c[i] >> d[i];
  int min_a = *min_element(ALL(a)), min_b = *min_element(ALL(b));
  REP(i, n) {
    a[i] -= min_a;
    b[i] -= min_b;
  }
  set<pair<ll, ll>> ball;
  REP(i, m) ball.emplace(c[i], d[i]);
  ll ans = 0;
  REP(bit, 1 << 2) {
    vector<ll> x(n), y(n);
    if (bit & 1) {
      REP(i, n) x[i] = -a[i];
    } else {
      REP(i, n) x[i] = a[i];
    }
    if (bit & 2) {
      REP(i, n) y[i] = -b[i];
    } else {
      REP(i, n) y[i] = b[i];
    }
    map<pair<ll, ll>, ll> score;
    REP(i, n) REP(j, m) {
      score[{c[j] - x[i], d[j] - y[i]}] += p[i];
    }
    for (auto [_, s] : score) chmax(ans, s);
  }
  cout << ans << '\n';
  return 0;
}