#include <bits/stdc++.h>
#define no "NO"
#define yes "YES"
#define F first
#define S second
#define vec vector
#define task "main"
#define ll long long
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())
using namespace std;
template<typename U, typename V> bool maximize(U &a, V b) {
if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool minimize(U &a, V b) {
if (a > b) { a = b; return 1; } return 0;
}
const int N = (int)2e5 + 9;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
int n, q;
ll s, t, ans = 0;
ll a[N], bit[N], diff[N];
bool f[N];
void update(int idx, ll val) {
while (idx <= n) {
bit[idx] += val;
idx += (idx & -idx);
}
}
ll get(int idx) {
ll res = 0;
while (idx > 0) {
res += bit[idx];
idx -= (idx & -idx);
}
return res;
}
void update(int l, int r, ll x) {
ans -= diff[l - 1];
update(l, x), update(r + 1, -x);
diff[l - 1] = get(l) - get(l - 1);
if (diff[l - 1] > 0) diff[l - 1] *= -s;
else diff[l - 1] *= -t;
ans += diff[l - 1];
if (r == n) return;
ans -= diff[r];
diff[r] = get(r + 1) - get(r);
if (diff[r] > 0) diff[r] *= -s;
else diff[r] *= -t;
ans += diff[r];
}
void main_code() {
cin >> n >> q >> s >> t;
FOR(i, 0, n) cin >> a[i];
FOR(i, 1, n) update(i, i, a[i]);
while (q--) {
int l, r;
ll x;
cin >> l >> r >> x;
update(l, r, x);
cout << ans << "\n";
}
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
const bool MULTITEST = 0;
int num_test = 1; if (MULTITEST) cin >> num_test;
while (num_test--) { main_code(); cout << "\n"; }
}
/* Lak lu theo dieu nhac */
