#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstdlib> 
using namespace std;
typedef long long ll;
const int M=1e6+5;
int n,u,v;
ll ans;
int A[M];
void check(int line){
	
	if(A[line]==A[line-1]&&line>1)ans=min(ans,min(0ll+u+v,0ll+v+v));
	if(abs(A[line]-A[line-1])>=1)ans=min(ans,min(0ll+v,0ll+u));
	
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--&&scanf("%d %d %d",&n,&u,&v)){
		ans=1e15+7;
		for(int i=1;i<=n;i++){
			scanf("%d",&A[i]);
		}
		A[0]=A[1];
		bool flag=false;
		for(int i=1;i<=n;i++){
			if(abs(A[i]-A[i-1])>=2){
				puts("0");
				flag=true;break;
			}
		}
		if(flag)continue;
		for(int i=1;i<=n;i++){
			check(i);
		}
		printf("%lld\n",ans);
	}
	return 0;
}
