#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int t;
cin >> t;
while(t--)
{
int n;
cin >> n;
string na1;
string na2;
cin >> na1 >> na2;
int arr[100000];
for(int i = 0; i <= n; i++)
{
cin >> arr[i];
}
int sum = 0;
for(int i = 0; i < n; i++)
{
if( na1[i] == na2[i])
{
sum++;
}
}
int max = 0;
if( sum == n)
max = arr[n];
else
{
for(int i = 0; i <= sum; i++)
{
max = (max > arr[i]) ? max : arr[i];
}
}
cout << max << endl;
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCB0OwoJY2luID4+IHQ7Cgl3aGlsZSh0LS0pCgl7CgkJaW50IG47CgkJY2luID4+IG47CgkJc3RyaW5nIG5hMTsKCQlzdHJpbmcgbmEyOwoJCWNpbiA+PiBuYTEgPj4gbmEyOwoJCWludCBhcnJbMTAwMDAwXTsKCQkKCQlmb3IoaW50IGkgPSAwOyBpIDw9IG47IGkrKykKCQl7CgkJCWNpbiA+PiBhcnJbaV07CgkJfQoJCWludCBzdW0gPSAwOwoJCWZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspCgkJewoJCQlpZiggbmExW2ldID09IG5hMltpXSkKCQkJewoJCQkJc3VtKys7CgkJCX0KCQl9CgkJaW50IG1heCA9IDA7CgkJaWYoIHN1bSA9PSBuKQoJCQltYXggPSBhcnJbbl07CgkJZWxzZSAKCQl7CgkJCWZvcihpbnQgaSA9IDA7IGkgPD0gc3VtOyBpKyspCgkJCXsKCQkJCW1heCA9IChtYXggPiBhcnJbaV0pID8gbWF4IDogYXJyW2ldOwoJCQl9CgkJfQoJCWNvdXQgPDwgbWF4IDw8IGVuZGw7Cgl9CglyZXR1cm4gMDsKfQ==