/// 407!3 +/ \!<07!\*
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvpi = vector<vpi>;
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
// pairs
#define mp make_pair
#define f first
#define s second
// vectors
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define er erase
#define ub upper_bound
#define lb lower_bound
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353;
const int MX = 1e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!
const char nl = '\n';
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}\n";}
void _print() {cerr << "\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T>
using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ook order_of_key
#define fbo find_by_order
void _input() {return;}
template <typename T, typename... V>
void _input(T &t, V&... v) {cin >> (t); if (sizeof...(v)) _input(v...);}
void __input(vi &v, const int n){F0R(i, n)cin >> v[i];}
void __input(vvi &v, const int n, const int m){F0R(i, n)F0R(j, m)cin>>v[i][j];}
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
vvl rnk(MX, vl(5));
vl par(MX, -1);
ll dsufind(ll x){
if(par[x] == -1)return x;
return par[x] = dsufind(par[x]);
}
void dsuunite(ll a, ll b){
ll pa = dsufind(a), pb = dsufind(b);
if(pa == pb)return;
if(rnk[pa][0] > rnk[pb][0]){
par[pb] = pa;
rnk[pa][2] += rnk[pb][2];
rnk[pa][1] = min(rnk[pa][1], rnk[pb][1]);
rnk[pa][0] = min(rnk[pa][0], rnk[pb][0]);
rnk[pa][3] = min(rnk[pa][3], rnk[pb][3]);
rnk[pa][4] = min(rnk[pa][4], rnk[pb][4]);
}
else{
par[pa] = pb;
rnk[pb][2] += rnk[pa][2];
rnk[pb][1] = min(rnk[pa][1], rnk[pb][1]);
rnk[pb][0] = min(rnk[pa][0], rnk[pb][0]);
rnk[pb][3] = min(rnk[pa][3], rnk[pb][3]);
rnk[pb][4] = min(rnk[pa][4], rnk[pb][4]);
}
}
vl calculate_costs(vi w, vi a, vi b, vi e){
ll n = sz(w), q = sz(e);
ll sol = 0, add = 0;
vpl v(n);
F0R(i, n){
sol += b[i];
add += (a[i] - b[i]);
v[i] = {w[i], a[i] - b[i]};
}
sor(v);
F0R(i, n){
rnk[i][0] = INF;
rnk[i][1] = INF;
rnk[i][2] = 1;
rnk[i][3] = INF;
if(i % 2)rnk[i][1] = v[i].s;
else rnk[i][0] = v[i].s;
rnk[i][4] = i;
}
vvl eg;
F0R(i, n - 1){
if(i != n - 2)eg.pb({v[i + 2].f - v[i].f, i, i + 2, i + 1});
eg.pb({v[i + 1].f - v[i].f, i, i + 1, -1});
}
sor(eg);
//_print(v);
//_print(eg);
vpl ask(q);
F0R(i, q)ask[i] = {e[i], i};
sor(ask);
vl rez(q);
ll i = 0, j = 0;
while(i < q){
ll x = ask[i].f;
while(j < sz(eg) && eg[j][0] <= x){
if(dsufind(eg[j][1]) == dsufind(eg[j][2])){
if(rnk[dsufind(eg[j][2])][2] % 2) add -= min(rnk[dsufind(eg[j][2])][3], rnk[dsufind(eg[j][2])][rnk[dsufind(eg[j][2])][4] % 2]);
if(eg[j][3] != -1)rnk[dsufind(eg[j][1])][3] = min(rnk[dsufind(eg[j][1])][3], v[eg[j][3]].s);
if(rnk[dsufind(eg[j][2])][2] % 2) add += min(rnk[dsufind(eg[j][2])][3], rnk[dsufind(eg[j][2])][rnk[dsufind(eg[j][2])][4] % 2]);
j++;
continue;
}
if(rnk[dsufind(eg[j][1])][2] % 2) add -= min(rnk[dsufind(eg[j][1])][3], rnk[dsufind(eg[j][1])][rnk[dsufind(eg[j][1])][4] % 2]);
if(rnk[dsufind(eg[j][2])][2] % 2) add -= min(rnk[dsufind(eg[j][2])][3], rnk[dsufind(eg[j][2])][rnk[dsufind(eg[j][2])][4] % 2]);
dsuunite(eg[j][1], eg[j][2]);
if(eg[j][3] != -1)rnk[dsufind(eg[j][1])][3] = min(rnk[dsufind(eg[j][1])][3], v[eg[j][3]].s);
//cout << rnk[dsufind(eg[j][2])][3] << " ";
if(rnk[dsufind(eg[j][2])][2] % 2)add += min(rnk[dsufind(eg[j][2])][3], rnk[dsufind(eg[j][2])][rnk[dsufind(eg[j][2])][4] % 2]);
j++;
}
//_print(i, j, add, sol, rnk);
rez[ask[i].s] = sol + add;
i++;
}
return rez;
}
