#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

#define pb push_back
#define F  first
#define S  second

const int maxn = 200;
const int maxn2 = 1e6 + 100;
int a[maxn];
int cnt[maxn2];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--){
        int n,u,v;
        cin >> n >> u >> v;
        for (int i = 0; i < n; i++){
            cin >> a[i];
        }
        int minANS = 8e9;
        for (int i = 0 ; i < n; i++){
            if (i == 0){
                if (abs(a[1] - a[0]) == 0){
                    minANS = min(minANS,min(u + v, v + v));
                }
                else if (abs(a[1] - a[0]) == 1){
                    minANS = min(minANS,min(u,v));
                }
                else{
                    minANS = 0;
                }
            }
            else if (i == n - 1){
                if (abs(a[n - 1] - a[n - 2]) == 0){
                    minANS = min(minANS,min(u + v, v + v));
                }
                else if (abs(a[n - 1] - a[n - 2]) == 1){
                    minANS = min(minANS,min(u,v));
                }
                else{
                    minANS = 0;
                }
            }
            else{
                int x = abs(a[i] - a[i - 1]);
                int y = abs(a[i] - a[i + 1]);
                if (x == 0 && y == 0){
                    minANS = min(minANS,min(u + v, v + v));
                }
                else if (x > 1 || y > 1){
                    minANS = 0;
                }
                else{
                    minANS = min(minANS,min(u,v));
                }
            }
        }
        cout << minANS << endl;
    }


}







