#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, l, r, Ql, Qr;
  cin >> n >> l >> r >> Ql >> Qr;
  vector<long long int> x(n);
  for (__typeof((n)) i = (0); i < (n); i += 1) cin >> x[i];
  x.push_back(0);
  long long int ans = 1e18;
  long long int sumar = accumulate((x).begin(), (x).end(), 0LL);
  long long int sumal = 0;
  for (__typeof((n + 1)) i = (0); i < (n + 1); i += 1) {
    long long int cur = sumal * l + sumar * r +
                        max(abs(i - (n - i)) - 1, 0) * (i > (n - i) ? Ql : Qr);
    sumal += x[i];
    sumar -= x[i];
    ans = min(ans, cur);
  }
  cout << ans;
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
