#include <bits/stdc++.h>
using namespace std;
int L[100002], R[100002];
int W[100002];
int main() {
  int n, l, r, Q[3];
  ios_base::sync_with_stdio(false);
  cin >> n >> l >> r >> Q[1] >> Q[2];
  Q[0] = 0;
  for (__typeof((n)) i = (1); i <= (n); i++) cin >> W[i];
  for (__typeof((n)) i = (1); i <= (n); i++) {
    L[i] = L[i - 1] + l * W[i];
  }
  for (int i = n; i >= 1; i--) {
    R[n - i + 1] = R[n - i] + r * W[i];
  }
  int ans = INT_MAX;
  for (__typeof((n)) i = (0); i <= (n); i++) {
    int j = n - i;
    if (abs(i - j) <= 1)
      ans = min(ans, L[i] + R[j]);
    else if (i > j)
      ans = min(ans, L[i] + R[j] + (i - j - 1) * Q[1]);
    else
      ans = min(ans, L[i] + R[j] + (j - i - 1) * Q[2]);
  }
  cout << ans << '\n';
  return 0;
}
