#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int N = 2e5 + 10;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    std::vector<int> posss(n + 1), hass(n + 1);
    for(int i = 1, x; i <= n; i ++ ) {
        cin >> x;
        posss[x] = i;
    }
    vector<int> a(m + 1);
    for(int i = 1, x; i <= m; i ++ ) {
        cin >> x;
        hass[x] = 1;
        a[i] = x;
    }
    for(int i = 1; i < m; i ++ ) {
        if(posss[a[i + 1]] < posss[a[i]]) {
            cout << "NO\n";
            return ;
        }
    }
    vector<int> b(k + 1), used(k + 1);
    for(int i = 1, x; i <= k; i ++ ) {
        cin >> x;
        b[i] = x;
    }
    vector<int> vis(n + 2), vis2(n + 2);
    vis[n + 1] = vis[0] = 1;
    vector<int> need_del(n + 1);
    for(int i = n; i >= 1; i -- ) {
        if(!hass[i]) {
            int l = 0, r = 0;
            for(int j = posss[i]; j <= n + 1; j ++ ) {
                if(vis[j]) {
                    r = j;
                    break;
                }
            }
            for(int j = posss[i]; j >= 0; j -- ) {
                if(vis[j]) {
                    l = j;
                    break;
                }
            }
            int w = r - l - 1;
            for(int j = l + 1; j < r; j ++ ) {
                if(vis2[j]) w -- ;
            }
            bool fg2 = 1;
            for(int j = k; j >= 1; j -- ) {
                if(!used[j] && b[j] <= w) {
                    used[j] = 1;
                    fg2 = 0;
                    break;
                }
            }
            if(fg2) {
                cout << "NO\n";
                return;
            } else {
                vis2[posss[i]] = 1;
                // need_del[posss[i]] = 1;
            }
        } else {
            vis[posss[i]] = 1;
        }
    }
    cout << "YES\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    int t = 1;
    cin >> t;
    while(t -- ) {
        solve();
    }

    return 0;
}