#include <bits/stdc++.h>
using namespace std;
int arr[100009];
int sumLeft[100009], sumRight[100009];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, l, r, Qr, Ql, total = 0, res = INT_MAX, currSum = 0;
  cin >> n >> l >> r >> Ql >> Qr;
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
    total += arr[i];
  }
  for (int i = 0; i <= n; ++i) {
    if (i >= 0) currSum += arr[i - 1];
    int temp = currSum * l + (total - currSum) * r;
    if (i <= n - i) {
      temp += max(0, (n - (2 * i + 1)) * Qr);
    } else {
      temp += (n - (2 * (n - i) + 1)) * Ql;
    }
    res = min(res, temp);
  }
  cout << res << endl;
  return 0;
}
