#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

void solve() {
  int n, m;
  cin >> n >> m;
  vector<int> a(m), b(m);
  rep(i,0,m) cin >> a[i];
  rep(i,0,m) cin >> b[i];
  map<int,vector<int>> mp;
  rep(i,0,m) {
    mp[a[i]].eb(b[i]);
  }
  int x = -1;
  for (auto [e, v] : mp) {
    sort(all(v));
    if (x != -1) {
      if (x >= v[0]) {
        cout << "No" << endl;
        return;
      }
    }
    map<int,int> cnt;
    for (int d : v) {
      ++cnt[d];
    }
    for (auto [d, c] : cnt) {
      if (d != e && c > 1) {
        cout << "No" << endl;
        return;
      }
    }
    x = v.back();
  }
  cout << "Yes" << endl;
}

int main() {
  int q;
  cin >> q;
  while(q--) solve();
  return 0;
}