#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int maxn = 3e5 + 69;
int n, m, k, a[maxn], ans;
vector<int> g[maxn];
void dfs(int v, int nmask) {
if (nmask == 0) {
++ans;
return;
}
for (auto u : g[v]) {
if (nmask & (1 << a[u]))
dfs(u, nmask ^ (1 << a[u]));
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
cin >> n >> m >> k;
for (int i = 1;i <= n;i++) {
cin >> a[i];
--a[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 mask = 1;mask < (1 << k);mask++) {
for (int i = 1;i <= n;i++) {
if (mask & (1 << a[i]))
dfs(i, mask ^ (1 << a[i]));
}
}
ans -= n;
cout << ans;
}
return 0;
}
