// template version 1.15
using namespace std;
#include <bits/stdc++.h>

// varibable settings
#define int long long
const int INF=1e18;

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

#define divceil(a,b) ((a)+(b)-1)/(b)
#define is_in(x, a, b) ((a)<=(x) && (x)<(b))
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define slice(l, r) substr(l, r-l)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
#else
    #define dump(...) 42
    #define dump_1d(...) 42
    #define dump_2d(...) 42
    #define cerrendl 42
#endif
//}}}

struct UnionFind {
    vector<int> data;  // size defined only for root node
    int count;  // count of groups

    UnionFind(){}
    UnionFind(int size) : data(size, -1), count(size){}
    bool merge(int x, int y) {/*{{{*/
        x=root(x); y=root(y);
        if (x!=y) {
            if (data[y]<data[x]) swap(x, y);
            data[x]+=data[y]; data[y]=x;
            count--;
        }
        return x != y;
    }/*}}}*/
    int root(int x) { return (data[x]<0 ? x : data[x]=root(data[x])); }
    bool same(int x,int y){ return root(x)==root(y); }
    int size(int x) { return -data[root(x)]; }

#if defined(PCM) || defined(LOCAL) // {{{
    friend auto& operator<<(auto &os, UnionFind& uf){
        map<int, vector<int>> group;
        rep(i, sz(uf.data)){ group[uf.root(i)].pb(i); }
        os << endl; each(g, group){ os << g << endl; }
        return os;
    }
#endif // }}}
};

signed main() {
    int n,m;cin>>n>>m;
    vector<int> p(n);
    map<int, int> pos;
    rep(i, n) {
        cin>>p[i];
        p[i]--;
        pos[p[i]] = i;
    }
    dump(p);

    UnionFind uf(n);

    vi x(m), y(m);
    rep(i, m){
        cin>>x[i]>>y[i];
        x[i]--;y[i]--;
        uf.merge(p[x[i]], p[y[i]]);
    }

    dump(uf);

    vvi g(n);
    rep(i, n){
        g[uf.root(i)].pb(i);
    }

    int ans = 0;
    rep(i, n){
        set<int> st;
        each(u, g[i]){
            st.insert(u);
        }
        each(u, g[i]){
            if (st.find(pos[u])!=st.end()) ans++;
        }
    }
    cout << ans << endl;
    
    return 0;
}


Measured memory_bytes: 17528