#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 1000000 + 10;
int n;
int l, r, q1, q2;
int a[N];
int sum[N];
int ans = inf;
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> l >> r >> q1 >> q2;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  for (int i = 0; i <= n; i++) {
    int t = n - 2 * i;
    if (t >= 0) {
      if (t == 0) t = 1;
      ans = min(ans, l * (sum[i]) + r * (sum[n] - sum[i]) + (t - 1) * q2);
    } else {
      t = -t;
      ans = min(ans, l * (sum[i]) + r * (sum[n] - sum[i]) + (t - 1) * q1);
    }
  }
  cout << ans << endl;
  return 0;
}
