【每日一题】打卡 27

原题链接：Dashboard - Codeforces Round #821 (Div. 2) - Codeforces

#define _CRT_SECURE_NO_WARNINGS 1
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<math.h>
#define FOR(a,b) for(int i=a;i<=b;i++)
#define ROF(a,b) for(int i=a;i>=b;i--)
#define FORj(a,b) for(int j=a;j<=b;j++)
#define ROFj(a,b) for(int j=a;j>=b;j--)
#define FORk(a,b) for(int k=a;k<=b;k++)
#define ROFk(a,b) for(int k=a;k>=b;k--)
#define mem(i,a) memset(i,a,sizeof(i))
#define ll long long
#define inf 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define int  long long
#define endl '\n'
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define pi acos(-1.0)
using namespace std;
const int maxn = 5e6 + 5;
void solve() {
	vector<int>p;
	string s1, s2;
	int n, a, b;
	cin >> n >> a >> b >> s1 >> s2;
	FOR(0, n - 1) {
		if (s1[i] != s2[i])p.push_back(i);
	}
	int k=p.size();
	if(k%2) {
		cout<<-1<<endl;
		return ;
	}
	if(p.size()==2&&p[0]+1==p[1])cout<<min(a,2*b)<<endl;
	else cout << p.size() / 2 * b << endl;
}
signed main() {
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);
	int _;
	cin >> _;
	while (_--)
		solve();
	return 0;
}