#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rrep(i,a,b) for(ll i=(ll)(a-1);i>=(ll)(b);i--)
#define MOD 998244353
//#define MOD 1000000007
#define INF 1e18
#define Pair pair<ll,ll>
//#define PI numbers::pi
//#define E numbers::e
template <typename T> bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
ll dx[8]={-2,-1,1,2,-2,-1,1,2};
ll dy[8]={-1,-2,-2,-1,1,2,2,1};

int main(){
    ll n,m; cin >> n >> m;
    vector<ll> a(n),b(m),c(n);
    rep(i,0,n) cin >> a[i];
    rep(i,0,m) cin >> b[i];
    rep(i,0,n) cin >> c[i];
    map<ll,ll> mp;
    ll d=0,sum=0;
    rep(i,0,n) sum+=c[i];
    rep(i,1,n){
        d+=b[(i-1)%m];
        mp[a[i]-d]+=c[i];
    }
    ll ans=INF;
    for(auto&& [k,l]:mp){
        if(a[0]==k) chmin(ans,sum-l-c[0]);
        else chmin(ans,sum-l);
    }
    cout << ans << endl;
    //for(auto&& [k,l]:mp) cout << k << ' ' << l << endl;
}