#include <bits/stdc++.h>

using i64 = long long;

constexpr i64 inf = 1E18;

void solve() {
    int n, L, a, b;
    std::cin >> n >> L >> a >> b;
    
    std::vector<std::array<int, 2>> p;
    for (int i = 0; i < n; i++) {
        char t;
        int x;
        std::cin >> t >> x;
        p.push_back({x, t == 'E' ? 0 : 1});
    }
    std::sort(p.begin(), p.end());
    std::array<i64, 3> dp {0LL, inf, inf};
    for (int i = 0; i < n; i++) {
        if (p[i][1] == 0) {
            dp = {
                dp[0] + a,
                std::min({dp[1] + a, dp[0], dp[1] + b, dp[2]}),
                dp[2] + a
            };
        } else {
            dp = {
                dp[0] + a,
                dp[1] + a,
                std::min({dp[2] + a, dp[0], dp[1] + b, dp[2] + b}),
            };
        }
    }
    
    i64 ans = *std::min_element(dp.begin(), dp.end());
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}