#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 200005;
const int inf = 1e9 + 5;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
int n, q, S, T;
int niz[maxn];
ll bor[4 * maxn];
ll lenj[4 * maxn];
void build(int v, int tl, int tr) {
if(tl == tr) {
bor[v] = niz[tl];
return;
}
int mid = (tl + tr) / 2;
build(v * 2, tl, mid);
build(v * 2 + 1, mid + 1, tr);
bor[v] = bor[v * 2] + bor[v * 2 + 1];
}
void propagate(int v, int tl, int tr) {
if(lenj[v]) {
bor[v] += lenj[v];
if(tl != tr) {
lenj[v * 2] += lenj[v];
lenj[v * 2 + 1] += lenj[v];
}
lenj[v] = 0;
}
}
void lazyupd(int v, int tl, int tr, int l, int r, ll val) {
propagate(v, tl, tr);
if(tl > tr || l > tr || tl > r)return;
if(tl >= l && tr <= r) {
bor[v] += val;
if(tl != tr) {
lenj[v * 2] += val;
lenj[v * 2 + 1] += val;
}
return;
}
int mid = (tl + tr) / 2;
lazyupd(v * 2, tl, mid, l, r, val);
lazyupd(v * 2 + 1, mid + 1, tr, l, r, val);
}
ll get(int v, int tl, int tr, int pos) {
propagate(v, tl, tr);
if(tl == tr)return bor[v];
int mid = (tl + tr) / 2;
if(pos <= mid)get(v * 2, tl, mid, pos);
else get(v * 2 + 1, mid + 1, tr, pos);
}
ll uk = 0;
void add_levo(int pos, int sgn) {
ll X = get(1,1,n,pos);
ll Y = (pos == 1 ? 0 : get(1,1,n,pos - 1));
uk += 1ll * sgn * (Y < X ? -S : T) * abs(X - Y);
}
void add_desno(int pos, int sgn) {
if(pos == n)return;
ll X = get(1,1,n,pos);
ll Y = get(1,1,n,pos + 1);
uk += 1ll * sgn * (X < Y ? -S : T) * abs(X - Y);
}
int main()
{
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
cin >> n >> q >> S >> T;
ff(i,0,n)cin >> niz[i];
ff(i,1,n)uk += 1ll * (niz[i - 1] < niz[i] ? -S : T) * abs(niz[i] - niz[i - 1]);
build(1,1,n);
while(q--) {
int L, R, X;
cin >> L >> R >> X;
if(L == R) {
add_levo(L, -1);
add_desno(L, -1);
lazyupd(1,1,n,L,R,X);
add_levo(L, 1);
add_desno(L, 1);
cout << uk << '\n';
continue;
}
if(L == R - 1) {
add_levo(L, -1);
add_desno(L, -1);
add_desno(R, -1);
lazyupd(1,1,n,L,R,X);
add_levo(L, 1);
add_desno(L, 1);
add_desno(R, 1);
cout << uk << '\n';
continue;
}
add_levo(L, -1);
add_levo(R, -1);
add_desno(L, -1);
add_desno(L, -1);
lazyupd(1,1,n,L,R,X);
add_levo(L, 1);
add_levo(R, 1);
add_desno(L, 1);
add_desno(L, 1);
cout << uk << '\n';
}
return 0;
}
/**
2 1 5 5
0 6 -1
1 1 4
// probati bojenje sahovski ili slicno
**/
