#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, l, r, ql, qr;
  scanf("%lld %lld %lld %lld %lld", &n, &l, &r, &ql, &qr);
  long long a[n + 10], pre[n + 10], post[n + 10];
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
  pre[0] = 0;
  for (long long i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
  post[n + 1] = 0;
  for (long long i = n; i >= 1; i--) post[i] = post[i + 1] + a[i];
  long long res = pre[n] * l + ql * (n - 1);
  for (long long rt = 1; rt <= n; rt++) {
    long long lt = n - rt;
    long long x = pre[lt] * l + post[n - rt + 1] * r;
    if (lt > rt)
      x += (lt - rt - 1) * ql;
    else if (lt < rt)
      x += (rt - lt - 1) * qr;
    res = min(res, x);
  }
  printf("%lld", res);
  return 0;
}
