#include <bits/stdc++.h>
using namespace std;
int MAX = 1000000009;
int comparedec(int a, int b) {
  if (a > b) {
    return 1;
  }
  return 0;
}
int compareinc(int a, int b) {
  if (a < b) {
    return 1;
  }
  return 0;
}
int main() {
  int i, j;
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  int a[n];
  int sumb[n];
  int sume[n];
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  sumb[0] = a[0];
  for (i = 1; i < n; i++) {
    sumb[i] = sumb[i - 1] + a[i];
  }
  sume[n - 1] = a[n - 1];
  for (i = n - 2; i >= 0; i--) {
    sume[i] = sume[i + 1] + a[i];
  }
  long long int minn = 10000000000000;
  long long int k;
  int nl, nr;
  for (i = -1; i < n; i++) {
    if (i == -1) {
      k = sume[i + 1] * r;
    } else if (i == n - 1) {
      k = sumb[i] * l;
    } else {
      k = sumb[i] * l + sume[i + 1] * r;
    }
    nl = i + 1;
    nr = n - nl;
    if (nl > nr) {
      k += (nl - nr - 1) * ql;
    } else if (nr > nl) {
      k += (nr - nl - 1) * qr;
    }
    if (k <= minn) {
      minn = k;
    }
  }
  cout << minn << endl;
  return 0;
}
