#include <bits/stdc++.h>
using namespace std;
int n, l, r, ql, qr;
int inp[100100];
int sl[100100], sr[100100];
int main() {
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (int i = 0; i < n; ++i) scanf("%d", &inp[i]);
  int ans = 0x3F3F3F3F;
  ans <<= 1;
  sl[0] = inp[0];
  for (int i = 1; i < n; ++i) sl[i] = sl[i - 1] + inp[i];
  sr[n] = 0;
  for (int i = n - 1; i >= 0; --i) sr[i] = sr[i + 1] + inp[i];
  for (int i = 0; i < n + 1; ++i) {
    int left = i, right = n - i;
    int u = ql * max(0, (left - 1 - right));
    u += qr * max(0, (right - left));
    int v = qr * max(0, (right - 1 - left));
    v += ql * max(0, (left - right));
    v = min(u, v);
    if (i) v += l * sl[i - 1];
    v += r * sr[i];
    ans = min(ans, v);
  }
  printf("%d\n", ans);
  return 0;
}
