#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long powm(long long base, long long exp, long long mod = 1000000007) {
  long long ans = 1;
  while (exp) {
    if (exp & 1) ans = (ans * base) % mod;
    exp >>= 1, base = (base * base) % mod;
  }
  return ans;
}
long long a[100005], suff[100005];
int main() {
  long long n, l, r, ql, qr, pre = 0, ans = 1000111000111000111LL;
  cin >> n >> l >> r >> ql >> qr;
  for (long long i = 1; i < n + 1; i++) cin >> a[i];
  for (long long i = n; i >= 1; i--) suff[i] = suff[i + 1] + a[i];
  for (long long i = 0; i < n + 1; i++) {
    pre += a[i];
    long long tmp1 = l * pre;
    long long tmp2 = r * suff[i + 1];
    long long tmp = (n - 2 * i), tmp3 = 0;
    if (abs(tmp) > 1) {
      tmp = abs(tmp);
      if (i > n - i)
        tmp3 = ((tmp - 1) * ql);
      else
        tmp3 = ((tmp - 1) * qr);
    }
    long long curr = tmp3 + tmp1 + tmp2;
    ans = min(ans, curr);
  }
  cout << ans;
  return 0;
}
