#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include <time.h>
#endif
#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) \
{ \
++recur_depth; \
auto x_ = x; \
--recur_depth; \
cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":" \
<< __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl; \
}
#else
#define dbg(x)
#endif
using namespace std;
using namespace __gnu_pbds;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
!is_same<T_container, string>::value,
typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
os << '{';
string sep;
for (const T &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;
struct FT {
int n;
vl t;
void init(int n_) {
n = n_;
t = vl(n + 1);
}
void upd(int idx, ll v) {
for (idx++; idx<=n; idx += idx & -idx)
t[idx] += v;
}
ll query(int idx) {
ll res = 0;
for (idx++; idx>0; idx -= idx & -idx)
res += t[idx];
return res;
}
void upd(int l, int r, ll v) {
upd(l, v); upd(r + 1, -v);
}
} ft1, ft2;
void solve() {
ll n, q, s, t; cin >> n >> q >> s >> t;
vl h(n + 1); for (ll &x : h) cin >> x;
ft1.init(n + 2); ft2.init(n + 2);
for (int i=0; i<=n; i++) ft1.upd(i, i, h[i]);
vl temp(n + 1); for (int i=1; i<=n; i++) {
if (h[i - 1] < h[i]) temp[i] = temp[i - 1] - (h[i] - h[i - 1]) * s;
else temp[i] = temp[i - 1] + (h[i - 1] - h[i]) * t;
ft2.upd(i, i, temp[i]);
}
auto increase = [&](int idx, ll v) {
ll ph = ft1.query(idx - 1), ch = ft1.query(idx);
ft1.upd(idx, n, v);
if (ph <= ch) {
ft2.upd(idx, n, -v * s);
return;
}
ll fv = ph - ch;
if (v < fv) {
ft2.upd(idx, -v * t);
return;
}
ft2.upd(idx, n, -fv * t);
ft2.upd(idx, n, -(v - fv) * s);
};
auto decrease = [&](int idx, ll v) {
ll ph = ft1.query(idx - 1), ch = ft1.query(idx);
ft1.upd(idx, n, -v);
if (ph >= ch) {
ft2.upd(idx, n, v * t);
return;
}
ll fv = ch - ph;
if (v < fv) {
ft2.upd(idx, v * s);
return;
}
ft2.upd(idx, n, fv * s);
ft2.upd(idx, n, (v - fv) * t);
};
while (q--) {
int l, r; ll d; cin >> l >> r >> d;
if (d == 0) {
cout << ft2.query(n) << "\n";
continue;
}
// cerr << "L: " << l << " R: " << r << " D: " << d << "\n";
// cerr << "\tH: {"; for (int i=0; i<=n; i++) cerr << ft1.query(i) << ","; cerr << "}\n";
// cerr << "\tT: {"; for (int i=0; i<=n; i++) cerr << ft2.query(i) << ","; cerr << "}\n";
if (d > 0) {
increase(l, d);
decrease(r + 1, d);
} else {
decrease(l, -d);
increase(r + 1, -d);
}
// cerr << "\tNH: {"; for (int i=0; i<=n; i++) cerr << ft1.query(i) << ","; cerr << "}\n";
// cerr << "\tNT: {"; for (int i=0; i<=n; i++) cerr << ft2.query(i) << ","; cerr << "}\n";
cout << ft2.query(n) << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
clock_t start = clock();
int test_cases = 1;
/* cin >> test_cases; */
while (test_cases--)
solve();
#ifdef DEBUG
cerr << fixed << setprecision(10)
<< "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
<< "s\n";
#endif
return 0;
}
