#include <bits/stdc++.h>
using namespace std;
int N, l, r, Ql, Qr;
int A[100001];
int main() {
  scanf("%d%d%d%d%d", &N, &l, &r, &Ql, &Qr);
  for (int(i) = 0; (i) < (N); (i)++) scanf("%d", &A[i + 1]);
  for (int(i) = (1); (i) < (N + 1); (i)++) A[i] += A[i - 1];
  int ans = 1 << 30;
  for (int(i) = 0; (i) < (N + 1); (i)++) {
    int lf = i, rf = N - i;
    int pp = A[i] * l + (A[N] - A[i]) * r;
    int dif = max(0, abs(rf - lf) - 1);
    if (lf > rf)
      pp += Ql * dif;
    else
      pp += Qr * dif;
    ans = min(ans, pp);
  }
  printf("%d\n", ans);
}
