#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define dou double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define FORD(i,a,b) for(int i=(a); i>=(b); i--)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define el '\n'
#define all(x) (x).begin(), (x).end()
const int maxN = 2e5;
const int maxM = 3e3;
const int LOG = 20;
const int mod = (int)1e9 + 7;
const ll oo = 1e18;

int query;

namespace subtask1
{
    int n, a[maxN+5];
    string s;
    
    string cal(string x)
    {
        string temp = " ";
        FOR(i,1,n)
        {
            int idx = a[i];
            temp += x[idx];
        }
        return temp;
    }
    
    void solve()
    {
        cin >> n;
        cin >> s;
        s = " " + s;
        FOR(i,1,n) cin >> a[i];
        set<string> st;
        queue<pair<string, int>> q;
        q.push({s, 0});
        while(!q.empty())
        {
            string x = q.front().fi;
            int kc = q.front().se;
            q.pop();
            string newX = cal(x);
            
            if(newX == s) 
            {
                cout << kc + 1 << el;
                break;
            }
            else if(!st.count(newX)) q.push({newX, kc+1});
        }
    }
}






int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    #define task "safe"
    if(fopen(task".inp", "r"))
    {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    cin >> query;
    while(query--)subtask1::solve();
   
    return 0;
}