#include <bits/stdc++.h>
#define task "TEST"
#define task2 "A"
#define pl pair<ll, ll>
#define VI vector<int>
#define VL vector<ll>
#define pf push_front
#define pb push_back
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b, c) for (int i=a; i<=b; i+=c)
#define FORE(i, a, b, c) for (int i=a; i>=b; i+=c)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int Mod = 1e9+7;
const int maxn = 2e5;
const ll Inf = 1e16;
ll n, q;
VL calculate_costs(VI W, VI A, VI B, VI E) {
q = E.size(); n = W.size();
ll sum = 0, mn = Inf, mn2 = Inf; VL res;
FOR(i, 0, n-1, 2) sum += B[i], mn = min(mn, (ll)A[i] - B[i]);
FOR(i, 0, n-1, 1) sum += B[i], mn2 = min(mn2, (ll)A[i] - B[i]);
FOR(i, 0, q-1, 1) {
if (n % 2 == 1) {
if (E[i] == 1) res.pb(sum + mn);
else res.pb(sum + mn2);
}
else res.pb(sum);
}
return res;
}
/*void Read()
{
}
void Solve()
{
}
int main()
{
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t;
for (cin >> t; t--;)
{
Read(); Solve();
}
}*/
