#include <bits/stdc++.h>
int w[100100], cl[100100], cr[100100];
int N, L, R, QL, QR, sum, i, j, ans, cans;
int main() {
  scanf("%d %d %d %d %d", &N, &L, &R, &QL, &QR);
  for (i = 1; i <= N; i++) scanf("%d", &w[i]);
  cl[0] = 0;
  for (sum = 0, i = 1; i <= N; i++) {
    sum += w[i];
    cl[i] = sum * L;
  }
  cr[N + 1] = 0;
  for (sum = 0, i = N; i >= 1; i--) {
    sum += w[i];
    cr[i] = sum * R;
  }
  for (ans = 2100000000, i = 0; i <= N; i++) {
    j = N - i;
    cans = cl[i] + cr[i + 1];
    if (i > j + 1) cans += QL * (i - j - 1);
    if (j > i + 1) cans += QR * (j - i - 1);
    if (cans < ans) ans = cans;
  }
  printf("%d\n", ans);
  return 0;
}
