/*
* @Author: MaxPhast
* @File: test.cpp
* @Date: 2025-11-18 22:39:10
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int , int>
#define iii pair <int , ii>
#define iiii pair <ii , ii>
#define FOR(i , l , r) for(int i = (l) , _r = (r) ; i <= _r ; ++ i)
#define FORD(i , r , l) for(int i = (r) , _l = (l) ; i >= _l ; -- i)
#define ALL(vec) vec.begin() , vec.end()
#define UNI(vec) sort(ALL(vec)) , vec.erase(unique(ALL(vec)) , vec.end())
#define pb push_back
#define MASK(i) (1ll << i)
#define BIT(mask , i) ((mask >> i) & 1ll)
#define ON(mask , i) (mask | MASK(i))
#define OFF(mask , i) (mask & (~MASK(i)))
#define TURN(mask , i) (mask ^ MASK(i))
#define BP(mask) __builtin_popcountll(mask)
#define sqr(x) (1ll * (x) * (x))
#define fi first
#define se second
#define oo 1e18
#define time() cerr << " \n " << "Time : " << 1000.0 * clock() / CLOCKS_PER_SEC << "ms."
#define IO(TASK) if(fopen(#TASK".INP" , "r")){freopen(#TASK".INP" , "r" , stdin); freopen(#TASK".OUT" , "w" , stdout);}
template <class X , class Y>
bool maxz(X &a , const Y b)
{
if(a < b)
{
a = b;
return true;
}
return false;
}
template <class X , class Y>
bool minz(X &a , const Y b)
{
if(a > b)
{
a = b;
return true;
}
return false;
}
namespace MaxPhast
{
const int N = 2e5 + 5;
int n , q , s , t , cur;
int a[N] , lazy[N << 2];
void up(int id , int l , int r , int u , int v , int val)
{
if(l > v || r < u)
return;
if(l >= u && r <= v)
{
lazy[id] += val;
return;
}
int mid = l + r >> 1;
up(id << 1 , l , mid , u , v , val);
up(id << 1 | 1 , mid + 1 , r , u , v , val);
}
int get(int id , int l , int r , int pos)
{
if(l == r)
return lazy[id];
int mid = l + r >> 1;
if(pos <= mid)
return lazy[id] + get(id << 1 , l , mid , pos);
else
return lazy[id] + get(id << 1 | 1 , mid + 1 , r , pos);
}
void solve()
{
cin >> n >> q >> s >> t;
FOR(i , 0 , n)
cin >> a[i];
FOR(i , 1 , n)
{
int tmp = a[i - 1] - a[i];
if(tmp < 0)
cur += s * tmp;
else
cur += t * tmp;
}
while(q--)
{
int l , r , x; cin >> l >> r >> x;
if(l - 1 >= 0)
{
int tmp = (get(1 , 0 , n , l - 1) + a[l - 1]) - (get(1 , 0 , n , l) + a[l]);
if(tmp < 0)
cur -= s * tmp;
else
cur -= t * tmp;
}
if(r + 1 <= n)
{
int tmp = (get(1 , 0 , n , r) + a[r]) - (get(1 , 0 , n , r + 1) + a[r + 1]);
if(tmp < 0)
cur -= s * tmp;
else
cur -= t * tmp;
}
up(1 , 0 , n , l , r , x);
if(l - 1 >= 0)
{
int tmp = (get(1 , 0 , n , l - 1) + a[l - 1]) - (get(1 , 0 , n , l) + a[l]);
if(tmp < 0)
cur += s * tmp;
else
cur += t * tmp;
}
if(r + 1 <= n)
{
int tmp = (get(1 , 0 , n , r) + a[r]) - (get(1 , 0 , n , r + 1) + a[r + 1]);
if(tmp < 0)
cur += s * tmp;
else
cur += t * tmp;
}
cout << cur << "\n";
}
}
}
signed main()
{
ios_base :: sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
IO(test);
MaxPhast :: solve();
time();
}
/*
*/
