#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define F first
#define S second
#define all(x) x.begin(), x.end()
typedef pair<int, int>  PII;
typedef pair<ll, ll>    PLL;
const int mod = 1000000007;

//------------------------------------------------------------

void solve(){
    ll n, u, v;
    cin >> n >> u >> v;
    int A[n];
    for (auto &it : A){
        cin >> it;
    }

    ll ans = INT_MAX;
    for (int i=1; i<n; ++i){
        if (abs(A[i-1] - A[i]) == 0) ans = min({ans, 2*v, u+v});

        else if (abs(A[i-1] - A[i]) > 1){
            ans = 0;
            break;
        }
        else ans = min({ans, u, v});
    }
    cout << ans << '\n';
}


int main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL); cout.tie(NULL);
    int t = 1;
    cin >> t;

    while (t--){
        solve();
    }
}


// ------------------------------------------------------------