#include <bits/stdc++.h>
using namespace std;
template <typename T> using min_priority_queue = priority_queue<T,vector<T>,greater<T>>;

template<typename T>
void printv(vector<T> &v){
    bool b = false;
    for(auto i : v){
        if(b) cout << " ";
        else b = true;
        cout << i;
    }
    cout << endl;
}

template <typename T>
bool chmin(T &a, const T& b) {
    if (a > b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T &a, const T& b) {
    if (a < b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

void yn(bool b){
    if(b) cout << "Yes" << endl;
    else cout << "No" << endl;
}

struct UF {
    vector<int> par;
    vector<int> ran;
    vector<int> sz;

    UF(int n){
        par.resize(n);
        ran.resize(n);
        sz.resize(n,1);
        for(int i = 0; i < n; i++){
            par[i] = i;
        }
    }

    int find(int x){
        if(par[x] == x) return x;
        int rtn = find(par[x]);
        par[x] = rtn;
        return rtn;
    }

    void unite(int x, int y){
        x = find(x);
        y = find(y);
        if(x == y) return;
        if(ran[x] < ran[y]){
            par[x] = y;
            sz[y] += sz[x];
        }
        else{
            par[y] = x;
            sz[x] += sz[y];
            if(ran[x] == ran[y]){
                ran[x]++;
            }
        }
    }

    bool same(int x, int y){
        return find(x) == find(y);
    }

    int siz(int x){
        return sz[find(x)];
    }
};

bool debug;
bool randomInput;
void input(){
    if(debug && randomInput){
        
    }
    else{
        
    }
    return;
}

void calc(){
    int N, M;
    cin >> N >> M;
    vector<int> C(N);
    for(int i = 0; i < N; i++){
        cin >> C[i];
    }

    UF U(N);
    int cnt = 0;
    for(int i = 0; i < M; i++){
        int u, v;
        cin >> u >> v;
        u--; v--;
        if(C[u] != C[v]) continue;
        if(U.same(u, v)) continue;
        U.unite(u, v);
        cnt++;
    }

    set<int> C_set;
    for(int i : C) C_set.insert(i);

    cout << N - C_set.size() - cnt << endl;



    return;
}

int64_t ansSimple;
void calcSimple(){
    return;
}

void calc1(){
    int t; cin >> t;
    for(int i = 0; i < t; i++){
        input();
        calc();
        calcSimple();
    }
}

int main(){
    debug = 0;
    randomInput = 0;
    srand(time(NULL));
    cout << fixed << setprecision(12);
    if(debug){
        calc1();
    }
    else{
        input();
        calc();
    }
    return 0;
}
//