#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
    ll t;
    cin >> t;
    while (t--) {
        ll n, u, v;
        cin >> n >> u >> v;
        ll a[n + 1];
        ll maxDiff = 0;
        for (ll i = 1; i <= n; i++){
            cin >> a[i];
        }
        for (ll i = 2; i <= n; i++){
            if (maxDiff < abs(a[i - 1] - a[i])) {
                maxDiff = abs(a[i - 1] - a[i]);
            }
        }
        if (maxDiff == 0)
            cout << min(u + v, 2 * v) << endl;
        else if (maxDiff == 1)
            cout << min(u, v) << endl;
        else
            cout << 0 << endl;

    }

    return 0;
}