#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    int N, M, ans = 0;
    cin >> N >> M;
    vector<int> P(N), a(N), b(N), c(M), d(M);
    rep(i, 0, N) cin >> P[i];
    map<pair<int, int>, int> mp;
    rep(i, 0, N) {
        cin >> a[i] >> b[i];
        mp[make_pair(a[i], b[i])] = P[i];
    }
    rep(i, 0, M) cin >> c[i] >> d[i];
    rep(i, 0, 4) {
        if (i % 2) {
            rep(j, 0, M) c[j] *= -1;
        }
        if (i == 2) {
            rep(j, 0, M) d[j] *= -1;
        }
        rep(j, 0, N) {
            rep(k, 0, M) {
                int dx = a[j] - c[k], dy = b[j] - d[k], s = 0;
                rep(l, 0, M) {
                    if (mp.find(make_pair(c[l] + dx, d[l] + dy)) == mp.end()) continue;
                    s += mp[make_pair(c[l] + dx, d[l] + dy)];
                }
                ans = max(ans, s);
            }
        }
    }
    cout << ans << endl;
}