// minako   #include <bits/stdc++.h>   using namespace std;      #define endl   n    #define f first   #define s second   #define pb push_back   #define pii pair<int,int>   #define ll long long   #define pll pair <ll,ll>   #define faster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);      const ll M = 1e9 + 7;   const int N = 2e5 + 5;   const ll INF = 1e9;   const ll INF2 = 1e18;   const int K = 750;      ll  n,u,v,a[N],q;      int main() {    faster    cin >> q;    while (q--) {     cin >> n >> u >> v;     bool eq = 1,can = 0;     for (int i = 1; i <= n; i++) {      cin >> a[i];      if (a[i] != a[i - 1] && i > 1) eq = 0;      if (abs(a[i] - a[i - 1]) > 1 && i > 1) can = 1;     }     if (can) cout << 0 << endl;     else if (eq) cout << v + min(u,v) << endl;     else cout << min(u,v) << endl;;    }          return 0;   }   