#include <bits/stdc++.h>
using namespace std;
const int Nn = 1e5 + 5;
int N, L, R, Ql, Qr, A[Nn], Ans, Sum[Nn];
int main() {
  scanf("%d%d%d%d%d", &N, &L, &R, &Ql, &Qr);
  for (int i = 1; i <= N; i++) scanf("%d", &A[i]), Sum[i] = Sum[i - 1] + A[i];
  Ans = R * Sum[N] + Qr * (N - 1);
  for (int i = 1; i <= N; i++)
    Ans = min(Ans, Sum[i] * L + (Sum[N] - Sum[i]) * R +
                       max(0, (2 * i <= N ? Qr * (N - 2 * i - 1)
                                          : Ql * (2 * i - N - 1))));
  printf("%d\n", Ans);
  return 0;
}
