#include <bits/stdc++.h>
using namespace std;
const int N = 100001;
int n, l, r, ql, qr;
int w[N];
int main() {
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (int i = 0; i < n; i++) scanf("%d", w + i);
  for (int i = 1; i < n; i++) w[i] += w[i - 1];
  int ans = 0x7FFFFFFF;
  for (int L = 0; L <= n; L++) {
    int R = n - L;
    int cur = 0;
    int sumL = L > 0 ? w[L - 1] : 0;
    int sumR = R > 0 ? (w[n - 1] - w[n - R - 1]) : 0;
    if (L < R) {
      int consecutiveR = R - L;
      cur += max(0, (consecutiveR - 1)) * qr;
      cur += sumL * l;
      cur += sumR * r;
    } else {
      int consecutiveL = L - R;
      cur += max(0, (consecutiveL - 1)) * ql;
      cur += sumL * l;
      cur += sumR * r;
    }
    ans = min(ans, cur);
  }
  cout << ans << endl;
  return 0;
}
