#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const long long OO = 0x3f3f3f3f3f3f3f3f;
long long n, l, r, ql, qr;
long long W[N];
int main() {
  scanf("%lld %lld %lld %lld %lld", &n, &l, &r, &ql, &qr);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", W + i);
    W[i] += W[i - 1];
  }
  long long ans = OO;
  for (int p = 0; p <= n; p++) {
    long long nl = p, nr = n - p;
    long long costL = W[p] * l, costR = (W[n] - W[p]) * r;
    long long cost = costL + costR;
    if (nl - nr > 1) {
      cost += (nl - nr - 1) * ql;
    } else if (nr - nl > 1) {
      cost += (nr - nl - 1) * qr;
    }
    ans = min(ans, cost);
  }
  printf("%lld\n", ans);
  return 0;
}
