#include <bits/stdc++.h>
using namespace std;
int nums[110000];
long long dp[110000];
int main() {
  int n, l, r, Ql, Qr;
  long long res = (1LL << 60);
  cin >> n >> l >> r >> Ql >> Qr;
  for (int i = 1; i <= n; i++) {
    cin >> nums[i];
    dp[i] += dp[i - 1] + nums[i];
  }
  for (int i = 0; i <= n; i++) {
    long long chosen_r = (dp[n] - dp[i]) * r;
    long long chosen_l = (dp[i]) * l;
    long long extra_l = 0, extra_r = 0;
    if (i < n - i) {
      extra_r = (n - 2 * i - 1) * Qr;
    } else if (i > n - i) {
      extra_r = (i - (n - i) - 1) * Ql;
    }
    res = min(res, chosen_r + chosen_l + extra_r + extra_l);
  }
  cout << res << endl;
  return 0;
}
