#include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin() , v.end()
#define sz(v) int(v.size())
#define unq(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
//#include "nile.h"
using namespace std;
typedef long long ll;
typedef pair<int , int> ii;
typedef pair<long long , int> lli;
const int maxN = int(2e5)+7;
int n , q;
ll dp[maxN];
vector<int> w , a , b , e , id;
vector<ll> res;
namespace sub1{
bool check(){
return (q <= 5 && n <= 2000);
}
void solve(){
for (int d : e){
dp[0] = 0;
for (int i = 0 ; i < n ; i++){
ll s = 0;
int x = INT_MAX;
dp[i + 1] = ll(1e18);
for (int j = i ; j >= 0 ; j--){
s += b[id[j]];
x = min(x , a[id[j]] - b[id[j]]);
if (w[id[i]] - w[id[j]] <= d){
if ((i - j)&1){
dp[i + 1] = min(dp[i + 1] , dp[j] + s);
}
else{
dp[i + 1] = min(dp[i + 1] , dp[j] + s + 1ll * x);
}
}
else{
break;
}
}
}
res.push_back(dp[n]);
}
}
}
namespace sub2{
bool check(){
return (q <= 5);
}
void solve(){
for (int d : e){
dp[0] = 0;
for (int i = 0 ; i < n ; i++){
dp[i + 1] = dp[i] + 1ll * a[id[i]];
if (i - 1 >= 0 && w[id[i]] - w[id[i - 1]] <= d){
dp[i + 1] = min(dp[i + 1] , dp[i - 1] + 1ll * b[id[i]] + 1ll * b[id[i - 1]]);
}
if (i - 2 >= 0 && w[id[i]] - w[id[i - 2]] <= d){
dp[i + 1] = min(dp[i + 1] , dp[i - 2] + 1ll * b[id[i]] + 1ll * a[id[i - 1]] + 1ll * b[id[i - 2]]);
}
}
res.push_back(dp[n]);
}
}
}
vector<long long> calculate_costs(vector<int> _w , vector<int> _a , vector<int> _b , vector<int> _e){
w = _w; a = _a; b = _b; e = _e;
n = sz(w) , q = sz(e);
id.resize(n);
for (int i = 0 ; i < n ; i++) id[i] = i;
sort(all(id) , [](int x , int y){
return w[x] < w[y];
});
if (sub2::check()){
sub2::solve();
return res;
}
return res;
}
