#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define F first
#define S second
ll MOD = 1000000007;
 
ll power(ll base, ll n){
	if (n == 0) return 1;
	if (n == 1) return base;
	ll halfn = power(base, n/2);
	if (n % 2 == 0) return (halfn * halfn) % MOD;
	return (((halfn * halfn) % MOD) * base) % MOD;
}
 
ll inverse(ll n){
	return power(n, MOD-2);
}
 
ll add(ll a, ll b){
	return (a+b) % MOD;
}

ll mul(ll a, ll b){
	return (a*b) % MOD;
}

int main(){
	ios::sync_with_stdio(false);
	int TC; cin >> TC;
	while (TC--){
		int n, u, v; cin >> n >> u >> v;
		vi a(n); FOR(i, 0, n) cin >> a[i];
		int maxi = 0; FOR(i, 1, n) maxi = max(maxi, abs(a[i]-a[i-1]));
		if (maxi == 0){
			cout << min(2*v, u+v) << '\n'; continue;
		}
		if (maxi == 1){
			cout << min(u, v) << '\n'; continue;
		}
		cout << 0 << '\n';
	}
	return 0;
}



