#include <iostream>
using namespace std;

const int maxn = 1e5 + 10;
int n, p, q, x, y;
bool bi[maxn];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> p >> q >> x >> y;
    int nt = 0;
    for (int i = 1; i <= n; i++) {
        char h;
        cin >> h;
        if (h == '+') bi[i] = true;
        else if (h == '-') bi[i] = false;
        if (bi[i]) nt++;
        else nt--;
    }
    int nc = ((q - p) - nt) / 2;
    if (nc == 0) {
        cout << 0 << endl;
        return 0;
    }
    if (nc > 0) {
        int cnt = 0;
        // - to +
        int i = 1, j = n;   
        while (cnt < nc) {
            if (i > j) break;
            if (cnt < nc && bi[i] == false) {
                bi[i] = true; cnt++;
            }
            if (cnt < nc && bi[j] == false) {
                bi[j] = true; cnt++;
            }
            i++; j--;
        }
        int mm = 0x3f3f3f3f, nm = 0;
        for (int i = 1; i <= n; i++) {
            if (bi[i]) nm++;
            else nm--;
            mm = min(mm, nm);
        }
        if (mm >= 0) cout << nc * x << endl;
        else cout << nc * x - (p + mm) * y << endl;
    }
    else {
        // + to -
        nc = -nc;
        int mm = 0x3f3f3f3f, nm = 0;
        for (int i = 1; i <= n; i++) {
            if (bi[i]) nm++;
            else nm--;
            mm = min(mm, nm);
        }
        // cout << nc << endl;
        if (mm >= 0) cout << nc * x << endl;
        else cout << nc * x - (p + mm) * y << endl;
        // cout << nc * x << endl;
    }
    return 0;
}