#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
void solve(){
int n, m, k; cin >> n >> m >> k;
vector <int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i], a[i]--;
vector <int> adj[n + 1];
while (m--) {
int u, v; cin >> u >> v;
adj[u].emb(v);
adj[v].emb(u);
}
int dp[n + 1][1 << k]; memset(dp, 0, sizeof dp);
for (int i = 1; i <= n; i++) dp[i][1 << a[i]] = 1;
for (int mask = 1; mask < (1 << k); mask++) {
for (int u = 1; u <= n; u++) {
for (auto v : adj[u]) {
if (mask & (1 << a[v])) continue;
int nm = (mask ^ (1 << a[v]));
dp[v][nm] += dp[u][mask];
}
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < (1 << k); j++) {
if (__builtin_popcount(j) == 1) continue;
ans += dp[i][j];
}
}
cout << ans;
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
