#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
long long a[N], b[N];
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) cin >> a[i], b[i] = b[i - 1] + a[i];
  long long ans = LLONG_MAX;
  for (int i = 0; i <= n; i++) {
    int left = i, right = n - i;
    long long temp = b[left] * l + (b[n] - b[left]) * r;
    if (left > right) {
      temp += (left - right - 1) * ql;
    } else if (right > left) {
      temp += (right - left - 1) * qr;
    }
    ans = min(ans, temp);
  }
  cout << ans;
  return 0;
}
