#include <bits/stdc++.h>
using namespace std;
long long n, l, r, ql, qr, ans, w[200000], sw[200000], tans, s1, s2;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) cin >> w[i];
  for (int i = 1; i <= n; i++) {
    sw[i] = sw[i - 1] + w[i];
  }
  ans = sw[n] * l + (n - 1) * ql;
  ans = min(ans, sw[n] * r + (n - 1) * qr);
  for (int cp = 1; cp < n; cp++) {
    s1 = cp;
    s2 = n - cp;
    tans = sw[cp] * l + (sw[n] - sw[cp]) * r;
    if (s1 > s2) tans += (s1 - s2 - 1) * ql;
    if (s1 < s2) tans += (s2 - s1) * qr;
    ans = min(ans, tans);
    tans = sw[cp] * l + (sw[n] - sw[cp]) * r;
    swap(s1, s2);
    if (s1 > s2) tans += (s1 - s2 - 1) * qr;
    if (s1 < s2) tans += (s2 - s1) * ql;
    ans = min(ans, tans);
  }
  cout << ans << endl;
  cin.get();
  cin.get();
  return 0;
}
