#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nArr, numQuery, nDec, nInc;
int a[MAX], d[MAX];
void Whisper(){
cin >> nArr >> numQuery >> nDec >> nInc;
nDec = -nDec;
for (int i = 0; i <= nArr; ++i) cin >> a[i];
for (int i = 1; i <= nArr; ++i) d[i] = a[i] - a[i - 1];
int cur = 0;
for (int i = 1; i <= nArr; ++i){
if (d[i] > 0){
cur += d[i] * nDec;
}
else{
cur += -d[i] * nInc;
}
}
for (int i = 1; i <= numQuery; ++i){
int l, r, x; cin >> l >> r >> x;
if (d[l] > 0){
cur -= d[l] * nDec;
}
else{
cur -= -d[l] * nInc;
}
if (d[r + 1] > 0){
cur -= d[r + 1] * nDec;
}
else{
cur -= -d[r + 1] * nInc;
}
d[l] += x;
if (d[l] > 0){
cur += d[l] * nDec;
}
else{
cur += -d[l] * nInc;
}
if (r + 1 <= nArr)
d[r + 1] -= x;
if (d[r + 1] > 0){
cur += d[r + 1] * nDec;
}
else{
cur += -d[r + 1] * nInc;
}
cout << cur << '\n';
}
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
