#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int cum[N];
int main() {
  int n, l, r, Ql, Qr;
  scanf("%d %d %d %d %d", &n, &l, &r, &Ql, &Qr);
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    cum[i + 1] = cum[i] + x;
  }
  int ans = INT_MAX;
  for (int i = 0; i <= n; ++i) {
    int extra = (abs(i - n + i) - (abs(i - n + i) > 0)) * (i + i > n ? Ql : Qr);
    ans = min(ans, cum[i] * l + (cum[n] - cum[i]) * r + extra);
  }
  printf("%d", ans);
}
