#include <bits/stdc++.h>
using namespace std;
template <class T>
string str(T Number) {
  string Result;
  ostringstream convert;
  convert << Number;
  Result = convert.str();
  return Result;
}
int StringToNumber(const string &Text) {
  istringstream ss(Text);
  int result;
  return ss >> result ? result : 0;
}
template <class T>
inline vector<pair<T, int> > FACTORISE(T n) {
  vector<pair<T, int> > R;
  for (T i = 2; n > 1;) {
    if (n % i == 0) {
      int C = 0;
      for (; n % i == 0; C++, n /= i)
        ;
      R.push_back(make_pair(i, C));
    }
    i++;
    if (i > n / i) i = n;
  }
  if (n > 1) R.push_back(make_pair(n, 1));
  return R;
}
template <class T>
inline T TOTIENT(T n) {
  vector<pair<T, int> > R = FACTORISE(n);
  T r = n;
  for (int i = 0; i < R.size(); i++) r = r / R[i].first * (R[i].first - 1);
  return r;
}
double rnd(float d) { return floor(d + 0.49); }
long long power(long long a, long long b, long long mod) {
  long long ret = 1;
  while (b > 0) {
    if (b & 1) ret = (ret * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return ret % mod;
}
int main() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  int sum[n];
  sum[0] = 0;
  for (int i = 1; i < n + 1; i++) {
    int x;
    cin >> x;
    sum[i] = sum[i - 1] + x;
  }
  int minCost = INT_MAX, cost = 0;
  for (int j = 0; j <= n; j++) {
    if (abs(n - 2 * j) > 1) {
      cost = sum[j] * l + (sum[n] - sum[j]) * r;
      if (2 * j < n)
        cost += ((n - j) - j - 1) * qr;
      else
        cost += (j - (n - j) - 1) * ql;
      minCost = min(minCost, cost);
    } else {
      cost = sum[j] * l + (sum[n] - sum[j]) * r;
      minCost = min(minCost, cost);
    }
  }
  cout << minCost << endl;
  return 0;
}
