#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
const int INF = 1e9 + 7;
const long long INF2 = 1e15;
void solve(void) {}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  vector<long long> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  long long total = 0;
  vector<long long> left(n + 1), right(n + 1);
  for (long long i = 0; i < n; i++) {
    total += v[i] * l;
    left[i + 1] = total;
  }
  total = 0;
  for (long long i = n - 1; i >= 0; i--) {
    total += v[i] * r;
    right[i] = total;
  }
  long long ans = INF, current;
  for (long long i = 0; i <= n; i++) {
    long long a = i, b = n - i, change;
    current = INF;
    change = min(a, b);
    a -= change;
    b -= change;
    if (a) {
      a--;
      current = min(current, a * ql);
    } else if (b) {
      current = min(current, b * qr);
    } else {
      current = 0;
    }
    a = i, b = n - i;
    change = min(a, b);
    a -= change;
    b -= change;
    if (b) {
      b--;
      current = min(current, b * qr);
    } else if (a) {
      current = min(current, a * ql);
    } else {
      current = 0;
    }
    long long temp = 0;
    a = i, b = n - i;
    if (b) {
      b--;
      temp += qr * b;
    }
    if (a) {
      a--;
      temp += ql * a;
    }
    current = min(current, temp);
    ans = min(ans, current + left[i] + right[i]);
  }
  cout << ans << '\n';
}
