#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<long long>;
using vpi = vector<pair<long long, long long>>;
using pi = pair<long long, long long>;
const long long nax = 1e5 + 7;
const long long mod = 1e9 + 7;
const long long inf = numeric_limits<long long>::max() - (long long)9e6;
template <typename T>
struct prefix_sum {
  vector<T> pref;
  long long n;
  template <typename U>
  prefix_sum(vector<U> &vec) {
    n = vec.size();
    pref.resize(n);
    pref[0] = vec[0];
    for (long long i = 1; i < n; i++) {
      pref[i] = pref[i - 1] + vec[i];
    }
  }
  T sum(long long i) { return pref[i]; }
  T sum(long long i, long long j) {
    if (i == 0)
      return pref[j];
    else
      return pref[j] - pref[i - 1];
  }
};
long long n, l, r, ql, qr;
void test() {
  cin >> n >> l >> r >> ql >> qr;
  vi v(n + 2);
  for (long long i = 1; i <= n; i++) {
    cin >> v[i];
  }
  prefix_sum<long long> p(v);
  long long ans = inf;
  for (long long i = 0; i <= n; i++) {
    long long curr = p.sum(i) * l + p.sum(i + 1, n) * r;
    if (i > n - i)
      curr += (2 * i - n - 1) * ql;
    else if (n - i > i)
      curr += (n - 2 * i - 1) * qr;
    ans = min(ans, curr);
  }
  cout << ans;
}
signed main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  long long T = 1;
  while (T--) {
    test();
    cout << "\n";
  }
  return 0;
}
