#include <bits/stdc++.h>
using namespace std;
int n, l, r, Ql, Qr, res, suma, sumal;
int t[100007];
int main() {
  res = 2000000007;
  scanf("%d%d%d%d%d", &n, &l, &r, &Ql, &Qr);
  for (int i = 1; i <= (n); i++) scanf("%d", &t[i]);
  for (int i = 1; i <= (n); i++) suma += t[i];
  for (int i = 0; i <= (n); i++) {
    sumal += t[i];
    suma -= t[i];
    int pom = sumal * l + suma * r;
    int ilel = i;
    int ilep = n - i;
    if (ilel > ilep) pom += (ilel - ilep - 1) * Ql;
    if (ilep > ilel) pom += (ilep - ilel - 1) * Qr;
    res = min(res, pom);
  }
  printf("%d\n", res);
  return 0;
}
