#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, q;
        cin >> n >> q;
        vector<int> a(n + 1);
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
        }

        for (int i = 0; i < q; i++) {
            int x, y;
            cin >> x >> y;
            swap(a[x], a[y]);
        }

        int count = 0;
        for (int i = 1; i <= n; i++) {
            if (a[i] == i) {
                count++;
            }
        }
        cout << count << endl;
    }
    return 0;
}