#include <bits/stdc++.h>

using namespace std;

#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define IMP puts("IMPOSSIBLE")
#define Imp puts("Impossible")
#define imp puts("impossible")
#define M1 puts("-1")
#define pb push_back

template <typename T>
T dup(T x, T y)
{
    return (x + y - 1) / y;
};
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); }

using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using pll = pair<ll, ll>;
using setint = set<int32_t>;
using setstr = set<string>;
using qint = queue<int32_t>;
using qpint = queue<pint>;

constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;

struct unionfind
{
public:
    unionfind(int32_t n) : par(n), rank(n), sz(n)
    {
        rep(i, n)
        {
            par[i] = i; // 全てが根であるとして初期化
            rank[i] = 0;
            sz[i] = 1;
        }
    }

    // データが属する木の根を求める
    int32_t find(int32_t x)
    {
        if (par[x] == x)
            return x;
        return par[x] = find(par[x]);
    }

    void unite(int32_t x, int32_t y)
    { // x と y が属する木を併合
        x = find(x);
        y = find(y);
        if (x == y)
            return;

        if (rank[x] < rank[y])
        {
            par[x] = y;
            sz[y] += sz[x];
        }
        else
        {
            par[y] = x;
            sz[x] += sz[y];
            if (rank[x] == rank[y])
                ++rank[x];
        }
    }

    bool same(int32_t x, int32_t y)
    { // x と y が同じ木に属するか
        return find(x) == find(y);
    }

    int32_t size(int32_t x)
    {
        return sz[find(x)];
    }

    unordered_set<int32_t> members(int32_t x)
    {
        int32_t r = find(x);
        unordered_set<int32_t> ret;
        rep(i, par.size())
        {
            if (find(i) == r)
            {
                ret.insert(i);
            }
        }
        return ret;
    }

    vector<unordered_set<int32_t>> getAllMemberList()
    {
        vector<unordered_set<int32_t>> ret;
        ret.reserve(10000);
        unordered_set<int32_t> root_list;
        rep(i, par.size())
        {
            int32_t cur_root = find(i);
            if (root_list.count(cur_root) == 1)
            {
                continue;
            }
            else
            {
                root_list.insert(cur_root);
                auto member_list = members(i);
                ret.pb(member_list);
            }
        }
        return ret;
    }

private:
    vint par;  // 親
    vint rank; // ランク（根からの距離）
    vint sz;
};

class Timer
{
public:
    Timer() { reset(); }
    void reset()
    {
        start_time = chrono::high_resolution_clock::now();
    }
    chrono::milliseconds::rep elapsed()
    {
        auto cur_time = chrono::high_resolution_clock::now();
        return chrono::duration_cast<chrono::milliseconds>(cur_time - start_time).count();
    }

private:
    chrono::high_resolution_clock::time_point start_time;
};

void Main()
{
    Timer tm;

    int n, m;
    cin >> n >> m;
    vint p(n);
    rep(i, n) cin >> p[i];

    unionfind uf(n);

    rep(i, m)
    {
        int x, y;
        cin >> x >> y;
        uf.unite(x - 1, y - 1);
    }

    int ans = 0;
    rep(i, n)
    {
        if (uf.find(i) == uf.find(p[i] - 1))
        {
            ++ans;
        }
    }
    cout << ans << endl;
}

int main()
{
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(15);
    Main();
    return 0;
}


Measured memory_bytes: 1792