#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
int main(){
    int N, M;
    cin >> N >> M;
    vector<long long> P(N);
    for(int i = 0; i < N; i++) cin >> P[i];
    vector<long long> a(N), b(N), c(M), d(M);
    unordered_map<ull, int> m;
    unordered_set<ull> s;
    ull INF = 2000000000;
    for(int i = 0; i < N; i++) {
        cin >> a[i] >> b[i];
        a[i] *= 2;
        b[i] *= 2;
        m[(a[i] + INF) * INF + (b[i] + INF)] = i;
    }
    for(int i = 0; i < M; i++) {
        cin >> c[i] >> d[i];
        c[i] *= 2;
        d[i] *= 2;
    }
    int ans = 0;
    for(int i = 0; i < M; i++){
        for(int j = 0; j < N; j++){
            long long mx = (a[j] + c[i]) / 2;
            long long my = (b[j] + d[i]) / 2;
            if(s.count((mx + INF) * INF + (my + INF))) continue;
            s.insert((mx + INF) * INF + (my + INF));
            int res = 0, res2 = 0, res3 = 0, res4 = 0;
            for(int k = 0; k < M; k++){
                long long r = mx * 2 - c[k];
                long long l = my * 2 - d[k];
                if(m.count((r + INF) * INF + (l + INF))) {
                    res += P[m[(r + INF) * INF + (l + INF)]];
                }
                if(m.count((r + INF) * INF + (d[k] + INF))){
                    res2 += P[m[(r + INF) * INF + (d[k] + INF)]];
                }
                if(m.count((c[k] + INF) * INF + (l + INF))){
                    res3 += P[m[(c[k] + INF) * INF + (l + INF)]];
                }
                if(m.count((c[k] + INF) * INF + (d[k] + INF))){
                    res4 += P[m[(c[k] + INF) * INF + (d[k] + INF)]];
                }
            }
            ans = max({ans, res, res2, res3, res4});
        }
    }
    cout << ans << endl;
}