#include <bits/stdc++.h>
using namespace std;
int T, n, a, b;
char c;
long long f[200005][2];
int s[200005];
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d%d%d", &n, &a, &b);
    for (int i = 1; i <= n; i++) {
      scanf(" %c", &c);
      s[i] = c - '0';
    }
    f[0][0] = b;
    f[0][1] = 1e17;
    for (int i = 1; i <= n; i++) {
      if (s[i + 1] == 1) {
        f[i][0] = 1e17;
        f[i][1] = min(f[i - 1][0] + 2 * a, f[i - 1][1] + a) + 2 * b;
      } else {
        if (s[i] == 0)
          f[i][0] = min(f[i - 1][0] + a, f[i - 1][1] + 2 * a) + b;
        else
          f[i][0] = 1e17;
        f[i][1] = min(f[i - 1][0] + 2 * a, f[i - 1][1] + a) + 2 * b;
      }
    }
    if (f[n][0] != 1e17)
      printf("%lld\n", f[n][0]);
    else
      cout << 71;
  }
  return 0;
}
