/*NEVER GIVE UP*/
/*First try brute force and check if it is in the range of time complexity*/
/*Then try to solve the problem in mathematical form*/
/*Then try to imagine how the final ans will look like*/
/*Write on paper if still not able to get*/
/*Try to think diff. algorithms and data structures that could solve the problem*/
#include <bits/stdc++.h>
using namespace std;
int main()
{long long t=0,n=0,d=0,f=0,f1=0,v=0,h=0;
    cin>>t;
    for(long long i=0;i<t;i++)
    {
        cin>>n>>v>>h;
        long long a[n];
        for(long long j=0;j<n;j++)
        cin>>a[j];
        for(long long j=1;j<n;j++)
        {
            d=a[j]-a[j-1];
            if(d<0)
            d=-(d);
            if(d>=2)
            {
                f=1;
                break;
            }
            else if(d==1)
            f1=1;
        }
        if(f==1)
        cout<<0<<endl;
        else
        {
            if(f1==1)
            {
                if(v<=h)
                cout<<v<<endl;
                else
                cout<<h<<endl;
            }
            else
            {
                if((2*h)<=(v+h))
                cout<<(2*h)<<endl;
                else
                cout<<v+h<<endl;
            }
        }
        f=0;f1=0;d=0;
    }
}