// Original C++ solution (slower):
//https://vjudge.net/contest/333005#problem

/*

* Author : MaxSally

*/

/********   All Required Header Files ********/

#include<bits/stdc++.h>

using namespace std;

/*******  All Required define Pre-Processors and typedef Constants *******/

#define SCD(t) scanf("%d",&t)

#define SCLD(t) scanf("%ld",&t)

#define SCLLD(t) scanf("%lld",&t)

#define SCC(t) scanf("%c",&t)

#define SCS(t) scanf("%s",t)

#define SCF(t) scanf("%f",&t)

#define SCLF(t) scanf("%lf",&t)

#define mem(a, b) memset(a, (b), sizeof(a))

#define rep(i, j, k) for (int i = j ; i <= k ; ++i)

#define rrep(i, j, k) for (int i = j; i >= k; --i)

#define all(cont) cont.begin(), cont.end()

#define rall(cont) cont.end(), cont.begin()

#define foreach(i, a) for(auto i: a)

#define forEach(it, l) for (auto it = l.begin(); it != l.end(); it++)

#define in(A, B, C) assert( B <= A && A <= C)

#define mp make_pair

#define pb push_back

#define inf (int) (1e9 + 7)

#define epsi 1e-9

#define PI 3.1415926535897932384626433832795

#define mod 1000000007

#define read(type) readInt<type>()

#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

#define ll long long int

#define left tuyiuoi

#define right fgjhk

#define ss second

#define ff first

#define debug(a) cout << #a << ": " << a << endl

#define debuga1(a, l, r) rep(i, l, r) cout << a[i] << " "; cout << endl

#define Flag(n) cout << "here " << n << endl

const double pi=acos(-1.0);

typedef pair<int, int> pii;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef vector<vl> vll;

typedef pair<ll, ll> pll;

typedef vector<string> vs;

typedef vector<pii> vii;

typedef vector<pll> vpll;

typedef vector<vi> vvi;

typedef map<int,int> MPII;

typedef set<int> SETI;

typedef multiset<int> MSETI;

typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;



const int N = 100005;



int n, m, a[N], b[N];

vi graph[N];

bool visited[N];

vector<set<int> > connectedComponent;



void dfs(int s){

    stack<int> st; st.push(s);

    set<int> curS;

    int cnt = (int)connectedComponent.size();

    while((int)st.size()){

        int u = st.top();

        st.pop();

        visited[u] = 1;

        b[u] = cnt;

        curS.insert(u);

        foreach(t, graph[u]){

            if(visited[t]) continue;

            st.push(t);

        }

    }

    connectedComponent.pb(curS);

}



int main(){

    io;

    //freopen("input.txt", "r", stdin);

    mem(visited, 0);

    cin >> n >> m;

    rep(i, 1, n){

        cin >> a[i];

    }

    rep(i, 1, m){

        int x, y; cin >> x >> y;

        graph[x].pb(y);

        graph[y].pb(x);

    }

    rep(i, 1, n){

        if(visited[i]) continue;

        dfs(i);

    }

    int cnt = 0;

    rep(i, 1, n){

        if(!visited[i]){

            if(i == a[i]){

                cnt++;

            }

            continue;

        }

        if(connectedComponent[b[i]].find(a[i]) != connectedComponent[b[i]].end()){

            cnt++;

        }

    }

    cout << cnt;

    return 0;

}




// Optimized solution to the same problem (faster):
#include <iostream>

#include <fstream>

#include <cmath>

#include <algorithm>

#include <vector>

#include <set>

#include <map>

#include <stack>

#include <queue>

#include <cstdlib>

#include <cstdio>

#include <string>

#include <cstring>

#include <cassert>

#include <utility>

#include <iomanip>

#include <chrono>

#include <random>

#include <bitset>



using namespace std;



#define sz(x) (int) x.size()

#define unique(x) x.erase(unique(x.begin(), x.end()), x.end())

#define all(a) a.begin(), a.end()

#define sqr(x) ((x) * (x)) 

#define y1 aksjdaskdjksjfksdjf

#define left kdnvldvoiwejifejg

#define right lkdsjflksdjfdjfk

#define prev asdasfsadjkjsdfjs

#define tm aklsjdasjdasjdkdjjf

#define lcm hddalkwjeidjjhasda

#define random_shuffle asdasdd



const int MAXN = 105000;



int st[MAXN];



int getSet(int x) {

  if (st[x] == x)

    return x;

  st[x] = getSet(st[x]);

  return st[x];

}



void unite(int a, int b) {

  a = getSet(a); b = getSet(b);

  if (rand() & 1)

    swap(a, b);

  st[a] = b;

}



int n, m;

int p[MAXN];

int ans;



int main() { 



  scanf("%d %d", &n, &m);

  for (int i = 0; i < n; i++) {

    scanf("%d", &p[i]);

    st[i] = i;

  }



  for (int i = 0; i < m; i++) {

    int from, to;

    scanf("%d %d", &from, &to);

    from--; to--;

    unite(from, to);

  }



  for (int i = 0; i < n; i++) {

    if (getSet(i) == getSet(p[i] - 1)) {

      ans++;

    }

  }



  cout << ans << endl;



  return 0;

}


// Fastest known solution for this problem: