#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n, l, r, ql, qr, ans = LLONG_MAX;
long long a[N], pref[N];
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> l >> r >> ql >> qr;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    pref[i] = a[i] + pref[i - 1];
  }
  for (long long i = 0; i <= n; i++) {
    long long left = i;
    long long right = n - i;
    long long sumleft = pref[left];
    long long sumright = pref[n] - pref[i];
    long long curans = sumleft * l + sumright * r;
    long long diff = abs(right - left) - 1;
    if (left < right)
      curans += diff * qr;
    else if (left > right)
      curans += diff * ql;
    ans = min(ans, curans);
  }
  cout << ans;
  return 0;
}
