#include<iostream>

#include<cstring>

#include<cstdio>

#include<algorithm>

#include<vector>

using namespace std;

int n,m,k,c[],l,r,pre[];

vector<int> v[];

int findd(int x)

{

    int root = x;

    while(pre[root] != root)    root = pre[root];

    int i = x,j;

    while(pre[i] != root)

    {

        j = pre[i];

        pre[i] = root;

        i = j;

    }

    return root;

}

void join(int a,int b)

{

    int x = findd(a),y = findd(b);

    if(x != y)  pre[x] = y;

}

int main()

{

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

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

    {

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

        pre[i] = i;

    }

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

    {

        scanf("%d%d",&l,&r);

        join(l,r);

    }

    for(int i = ;i <= n;i++)    v[findd(i)].push_back(c[i]);

    int ans = ;

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

    {

        if(!v[i].size())    continue;

        sort(v[i].begin(),v[i].end());

        int endd = v[i].size(),maxx = ;

        for(int j = ,now = ;j < endd;++now,j = now)

        {

            while(now < endd- && v[i][now+] == v[i][j])    now++;

            maxx = max(maxx,now-j+);

        }

        ans += endd-maxx;

    }

    printf("%d\n",ans);

    return ;

}