#include <bits/stdc++.h>
using namespace std;
long long n, l, r, s[100010], p[100010], a[100010], ans = 2e9;
long long ql, qr;
int main() {
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; ++i) cin >> a[i], p[i] = p[i - 1] + a[i];
  for (int i = n; i >= 1; i--) s[i] = s[i + 1] + a[i];
  for (int i = 0; i <= n; ++i) {
    long long lll = i, rrr = n - i;
    long long num = p[i] * l + s[i + 1] * r;
    if (abs(lll - rrr) >= 2) {
      if (rrr > lll)
        num += qr * (abs(rrr - lll) - 1);
      else
        num += ql * (abs(rrr - lll) - 1);
    }
    ans = min(ans, num);
  }
  cout << ans;
  return 0;
}
