#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int c[105];
vector<int> g[105];
bool used[105];
bool col[5];
long long ans = 0;
void dfs(int v, int len) {
if (len >= 2) ans++;
for (int u : g[v]) {
if (used[u]) continue;
if (col[c[u]]) continue;
used[u] = true;
col[c[u]] = true;
dfs(u, len + 1);
col[c[u]] = false;
used[u] = false;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
cin >> c[i];
c[i]--;
}
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
for (int i = 1; i <= n; i++) {
used[i] = true;
col[c[i]] = true;
dfs(i, 1);
col[c[i]] = false;
used[i] = false;
}
cout << ans << '\n';
return 0;
}
