#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned int u_int;

struct ostacolo_t{
	int i, j;	
};

vector<int> ostacoli;

int main(){
	
	//freopen("input.txt", "r", stdin);
	int T, N, U, V;
	cin>>T;
	while(T--){
		cin>>N>>U>>V;
		for(int i = 0; i < N; i++){
			int j; cin>>j;
			ostacoli.push_back(j);
		}
		int min_cost = INT_MAX;
		for(int i = 1; i < N; i++){
			int prec = ostacoli[i-1];
			int j = ostacoli[i];
			if(prec == j){
				min_cost = min(min_cost, min(U+V, V+V));
			}else if(prec == j+1 || prec == j-1){
				min_cost = min(min_cost, min(U, V));
			}else{
				min_cost = 0;
			}
		}
		cout<<min_cost<<endl;
		ostacoli.clear();
	}
	
	
	return 0;
}