#include<bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10;

int c[N];

bool vis[N];

vector <int> G[N];

map <int,int> num;

int cur,maxm;

void dfs(int x)

{

    if(vis[x])

        return;

    cur++;

    maxm = max(maxm,++num[c[x]]);

    vis[x] = 1;

    for(int i = 0; i < G[x].size(); i++)

        dfs(G[x][i]);

}

int main()

{

    int n,m,k,ans = 0;

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

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

        scanf("%d",c+i);

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

    {

        int l,r;

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

        G[l].push_back(r);

        G[r].push_back(l);

    }

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

    {

        cur = maxm = 0;

        dfs(i);

        ans += cur - maxm;

        num.clear();

    }

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

    return 0;

}