#include <bits/stdc++.h>

using namespace std;
vector <long> z(200005,0);
long n,m;
long maximumPeople(vector <long> p, vector <long> x, vector <long> y, vector <long> r) {
    long int max=INT_MIN;
    for(int i=0;i<m;i++)
    {
        vector<long>::iterator lower,upper;
    lower = lower_bound (x.begin(), x.end(), y[i]+r[i]); 
    upper = upper_bound (x.begin(), x.end(), y[i]-r[i]);
        
        if(max<abs(p[lower-x.begin()]-p[upper-x.begin()]))
        {
            max=abs(p[lower- x.begin()]-p[(upper - x.begin())];
        }
                    z[(lower- x.begin())]=0;
        z[(upper - x.begin())]=0;
    }
}
                    int i=0;
                    while(z[i]!=0)
                    {
                        i++;
                   }
                    int j=n-1;
                    while(z[j]!=0)
                    {
                        j--;
                    }
                    long long int ans=0;
                    for(int k=i;k<=j;k++)
                    {
                        ans+=z[i];
                    }
                    return max+p[n-1]-ans;
                    }

int main() {
    
    vector<long> p(n);
    for(int p_i = 0; p_i < n; p_i++){
       cin >> p[p_i];
        z[p_i]=p[p_i];
    }
    for(int i=1;i<n;i++)
    {
        p[i]=p[i-1]+p[i];
    }
    vector<long> x(n);
    for(int x_i = 0; x_i < n; x_i++){
       cin >> x[x_i];
    }
    vector<long> y(m);
    for(int y_i = 0; y_i < m; y_i++){
       cin >> y[y_i];
    }
    vector<long> r(m);
    for(int r_i = 0; r_i < m; r_i++){
       cin >> r[r_i];
    }
    long result = maximumPeople(p, x, y, r);
    cout << result << endl;
    return 0;
}