#include <bits/stdc++.h>
using namespace std;
long long ara[100005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long int n, l, r, q_l, q_r, i;
  cin >> n >> l >> r >> q_l >> q_r;
  long long int ans = 1000000000000000;
  ara[0] = 0;
  for (i = 1; i <= n; i++) cin >> ara[i];
  for (i = 1; i <= n; i++) ara[i] += ara[i - 1];
  for (i = 0; i <= n; i++) {
    long long left_cost = ara[i], right_cost = ara[n] - ara[i];
    left_cost *= l;
    right_cost *= r;
    if (2 * i - n - 1 > 0)
      left_cost += (q_l * (2 * i - n - 1));
    else if (n - 2 * i - 1 > 0)
      right_cost += (q_r * (n - 2 * i - 1));
    if (left_cost + right_cost < ans) ans = left_cost + right_cost;
  }
  cout << ans << endl;
  return 0;
}
