#include <bits/stdc++.h>
using namespace std;
vector<string> split(const string& s, char c) {
  vector<string> v;
  stringstream ss(s);
  string x;
  while (getline(ss, x, c)) v.emplace_back(x);
  return move(v);
}
template <typename T, typename... Args>
inline string arrStr(T arr, int n) {
  stringstream s;
  s << "[";
  for (int i = 0; i < n - 1; i++) s << arr[i] << ",";
  s << arr[n - 1] << "]";
  return s.str();
}
inline void __evars_begin(int line) { cerr << "#" << line << ": "; }
template <typename T>
inline void __evars_out_var(vector<T> val) {
  cerr << arrStr(val, val.size());
}
template <typename T>
inline void __evars_out_var(T* val) {
  cerr << arrStr(val, 10);
}
template <typename T>
inline void __evars_out_var(T val) {
  cerr << val;
}
inline void __evars(vector<string>::iterator it) { cerr << endl; }
template <typename T, typename... Args>
inline void __evars(vector<string>::iterator it, T a, Args... args) {
  cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
  __evars_out_var(a);
  cerr << "; ";
  __evars(++it, args...);
}
const long long nmax = 1000 * 1007;
struct edge {
  long long a, b, cost;
  edge(long long x, long long y, long long z) : a(x), b(y), cost(z){};
};
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long n, l, r, ql, qr;
vector<long long> w(300105);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long ans = 1e18;
  cin >> n >> l >> r >> ql >> qr;
  for (long long i = 0; i < (long long)(n); i++) cin >> w[i];
  vector<long long> pre(n, 0), suf;
  pre[0] = w[0];
  suf.push_back(w[n - 1]);
  for (long long i = (long long)(1); i <= (long long)(n - 1); i++)
    pre[i] = pre[i - 1] + w[i];
  for (long long i = (long long)(n - 2); i >= (long long)(0); i--)
    suf.push_back(suf[suf.size() - 1] + w[i]);
  for (long long i = (long long)(0); i <= (long long)(n - 2); i++) {
    long long left = i, right = n - i - 2;
    if (left < right)
      ans = min(ans, pre[left] * l + suf[right] * r + (right - left - 1) * qr);
    else if (left > right)
      ans = min(ans, pre[left] * l + suf[right] * r + (left - right - 1) * ql);
    else
      ans = min(ans, pre[left] * l + suf[right] * r);
  }
  ans = min(ans, pre[n - 1] * l + max(ql * (n - 1), 0ll));
  ans = min(ans, suf[n - 1] * r + max(qr * (n - 1), 0ll));
  cout << ans << endl;
}
