#include<bits/stdc++.h>
#define For(i, a, b) for(int i = a, _b = b; i <= _b; ++i)
#define Ford(i, a, b) for(int i = a, _b = b; i >= _b; --i)
#define FileName "test"
#define ll long long
#define ld long double
#define ull unsigned long long
#define Print(x) cerr << #x << "is " << x << '\n';
#define pb push_back
#define X first
#define Y second
//#define Karma
using namespace std;
template<typename T> inline void Cin(T &x)
{
char c;
T sign = 1;
x = 0;
for (c = getchar(); c < '0' || c > '9'; c = getchar())
if (c == '-') sign = -1;
for (; c >= '0' && c <= '9'; c = getchar())
x = x * 10 + c - '0';
x *= sign;
}
template <typename T> inline void Out(T x) {if(x > 9) Out(x / 10); putchar(x % 10 + '0');}
template <typename T> inline void Cout(T x, char c) {if(x < 0) putchar('-'); x = abs(x); Out(x); putchar(c);}
template <typename T, typename... Args> inline void Cin(T& a, Args&... args) {Cin(a);Cin(args...);}
template <typename T, typename... Args> inline void Cout(T a, char c, Args... args) {Cout(a, c);Cout(args...);}
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
const int N = 1e6 + 7;
int n, Q, l, r;
ll s, t, pre, a[N], x, pos, neg;
void Enter()
{
Cin(n, Q, s, t, pre);
pos = neg = 0;
For(i, 1, n)
{
Cin(x), a[i] = x - pre, pre = x;
if(a[i] >= 0) pos += a[i];
else neg += a[i];
}
}
void Add(int p, ll v)
{
if(p > n) return;
if(a[p] < 0) neg -= a[p];
else pos -= a[p];
a[p] += v;
if(a[p] < 0) neg += a[p];
else pos += a[p];
}
void Solve()
{
while(Q --)
{
Cin(l, r, x);
Add(l, x), Add(r + 1, -x);
cout << - neg * t - pos * s << '\n';
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifdef Karma
freopen(FileName".inp", "r", stdin);
freopen(FileName".out", "w", stdout);
#endif // Karma
Enter();
Solve();
return 0;
}
