#include <bits/stdc++.h>
using namespace std;
int n, l, r, ql, qr, dpl[100010], dpr[100010], w[100010];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) {
    cin >> w[i];
    dpl[i] = dpl[i - 1] + w[i];
  }
  for (int i = n; i >= 1; i--) dpr[n - i + 1] = dpr[n - i] + w[i];
  int ans = 1e9;
  for (int i = 0; i <= n; i++) {
    int cur = dpl[i] * l + dpr[n - i] * r;
    if (i > n - i) cur += (i - n + i - 1) * ql;
    if (n - i > i) cur += (n - i - i - 1) * qr;
    ans = min(ans, cur);
  }
  cout << ans;
  return 0;
}
