#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int n,m,k;
vvi paths(3e5+10,vi());
vi arr(3e5+10);
ll ans = 0;
void dfs(int pos,int prev,int visited[],int len,vi path){
// for(int a:path)cerr << a+1 << " ";
// cerr << " | " << pos+1 << " " << arr[pos] << " " << visited[arr[pos]] << endl;
visited[arr[pos]] = 1;
len ++;
path.pb(pos);
if(len > 1){
ans ++;
// cerr << "ans ";
// for(int a:path)cerr << a+1 << " ";
// cerr << endl;
}
for(int a:paths[pos]){
if(a==prev)continue;
if(visited[arr[a]] == 0){
visited[arr[a]] = 1;
dfs(a,pos,visited,len,path);
visited[arr[a]] = 0;
}
}
}
void solve()
{
cin >> n >> m >> k;
FOR(i,0,n)cin >> arr[i];
FOR(i,0,m){
int a,b;cin >> a >> b;
a--;b--;
paths[a].pb(b);
paths[b].pb(a);
}
// cerr << endl;
FOR(i,0,n){
int visited[] = {0,0,0,0,0,0,0};
vi path;
dfs(i,-1,visited,0,path);
}
cout << ans << endl;
}
int main()
{
fastIO();
// init("test");
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
