#include <iostream>

using namespace std;

#define N 101

int main() {
    int t;
    cin >> t;

    for(int i = 0; i < t; ++i) {
        int n;
        long long u, v;
        cin >> n >> u >> v;

        int previous_pos = -1;
        int new_pos = -1;

        cin >> previous_pos;

        int max_gap = 0;
        for(int j = 1; j < n; ++j) {
            cin >> new_pos;
            max_gap = max(abs(new_pos - previous_pos), max_gap);
            previous_pos = new_pos;
        }

        if(max_gap == 0) {
            cout << (v + min(u, v)) << endl;
        }
        else if(max_gap == 1) {
            cout << min(u, v) << endl;
        }
        else {
            cout << 0 << endl;
        }
    }
}