#include <bits/stdc++.h>

using namespace std;

int a[110];

int main() {

    int t;
    cin >> t;

    while(t--) {
        int n,u,v;
        cin >> n >> u >> v;

        for (int i = 0; i < n; ++i)
            cin >> a[i];

        long long ans = 1e12;

        for (int i = 1; i < n; ++i) {
            if(abs(a[i] - a[i - 1]) >= 2) ans = 0;
        }
        for (int i = 0; i < n; ++i) {
            for (int j = -1; j <= 1; ++j) {
                int p = a[i] + j;
                if(i + 1 < n and p >= 0 and p <= 1e6 and abs(p - a[i + 1]) >= 2) ans = min(ans, 1LL * abs(j) * v);
                if(i - 1 >= 0 and p >= 0 and p <= 1e6 and abs(p - a[i - 1]) >= 2) ans = min(ans, 1LL * abs(j) * v);
            }
            if(i + 1 < n and a[i] != a[i + 1]) ans = min(ans, 1LL * u);
            if(i - 1 >= 0 and a[i] != a[i - 1]) ans = min(ans, 1LL * u);
        }
        ans = min(ans, 1LL * (u + v) );
        ans = min(ans, 1LL * (v + v));
        cout << ans << "\n";
    }
    return 0;
}
