#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
int cummL[N], cummR[N], arr[N];
int main() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  int u = n;
  for (int i = 1; i <= n; i++) {
    cummL[i] = arr[i] + cummL[i - 1];
    cummR[u] = arr[u] + cummR[u + 1];
    u--;
  }
  int x, ans = 2e9 + 50;
  for (int i = 0; i <= n; i++) {
    x = cummL[i] * l + cummR[i + 1] * r;
    if (i < n - i) {
      x += qr * (n - 2 * i - 1);
    } else if (i > n - i) {
      x += ql * (2 * i - n - 1);
    }
    ans = min(ans, x);
  }
  cout << ans;
}
