#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M;
  cin >> N >> M;
  vector<int> P(N);
  for (int i = 0; i < N; i++){
    cin >> P[i];
  }
  vector<int> a(N), b(N);
  for (int i = 0; i < N; i++){
    cin >> a[i] >> b[i];
  }
  vector<int> c(M), d(M);
  for (int i = 0; i < M; i++){
    cin >> c[i] >> d[i];
  }
  int ans = 0;
  for (int i = 0; i < 2; i++){
    for (int j = 0; j < 2; j++){
      vector<tuple<int, int, int>> S;
      for (int k = 0; k < M; k++){
        for (int l = 0; l < N; l++){
          int x;
          if (i == 0){
            x = a[l] - c[k];
          } else {
            x = a[l] + c[k];
          }
          int y;
          if (j == 0){
            y = b[l] - d[k];
          } else {
            y  = b[l] + d[k];
          }
          S.push_back(make_tuple(x, y, P[l]));
        }
      }
      sort(S.begin(), S.end());
      int sum = 0;
      for (int k = 0; k < N * M; k++){
        sum += get<2>(S[k]);
        if (k == N * M - 1){
          ans = max(ans, sum);
        } else if (get<0>(S[k]) != get<0>(S[k + 1]) || get<1>(S[k]) != get<1>(S[k + 1])){
          ans = max(ans, sum);
          sum = 0;
        }
      }
    }
  }
  cout << ans << endl;
}