#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

int N,M;
int L=808,ans=0;
vector<int> a(L),b(L),c(L),d(L),p(L);

void f(){
	map<pair<int,int>,int> m;
	rep(i,N) rep(j,M){
		m[{a[i]-c[j],b[i]-d[j]}]+=p[i];
	}
	for(auto x:m) chmax(ans,x.second);
	return ;
}

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	cin>>N>>M;
	rep(i,N) cin>>p[i];
	rep(i,N) cin>>a[i]>>b[i];
	rep(i,M) cin>>c[i]>>d[i];
	rep(k,4){
		if(k%2) rep(i,N) b[i]*=-1;
		f();
		rep(i,N) a[i]*=-1;
	}
	cout<<ans<<"\n";
}