#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 100;
const long long INF = 1e15 + 1;
long long r[maxn], l[maxn], A[maxn], ll, rr, Qr, Ql, n, minn;
int main() {
  minn = INF;
  cin >> n >> ll >> rr >> Ql >> Qr;
  for (long long i = 1; i <= n; i++) cin >> A[i];
  for (long long i = 1; i <= n; i++) l[i] = (l[i - 1] + A[i] * ll);
  for (long long i = n; i > 0; i--) r[i] = (r[i + 1] + A[i] * rr);
  for (long long i = 0; i <= n; i++) {
    long long tmp = l[i] + r[i + 1];
    long long ii = n - i - i;
    if (ii < -1) tmp += -(ii + 1) * Ql;
    if (ii > 1) tmp += (ii - 1) * Qr;
    minn = min(minn, tmp);
  }
  cout << minn;
}
