#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
signed main(){
  ll N,M,ans=0;cin>>N>>M;
  vector<ll>p(N);REP(i,N)cin>>p[i];
  vector<ll>a(N),b(N);REP(i,N)cin>>a[i]>>b[i];
  vector<P>cup(M);REP(i,M)cin>>cup[i].F>>cup[i].S;sort(ALL(cup));
  REP(q,4){
    REP(i,N)a[i]=-a[i];
    if(q==2)REP(i,N)b[i]=-b[i];
    REP(i,N)REP(j,M){
      //a[i]->cup[j].F,b[i]->cup[j].S
      ll x=cup[j].F-a[i],y=cup[j].S-b[i],res=0;
      REP(k,N)if(binary_search(ALL(cup),P(a[k]+x,b[k]+y)))res+=p[k];
      chmax(ans,res);
    }
  }
  cout<<ans<<endl;
  return 0;
}