/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;
/* START OF TEMPALTE */
// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())
#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
/* END OF TEMPALTE */
const int MAXN = 3e5 + 5;
const int MAXK = 7;
int n, m, k, col[MAXN];
ll dp[1 << MAXK][MAXN];
vector<int> adj[MAXN];
void init() {
cin >> n >> m >> k;
for (int i = 1; i <= n; ++i) {
cin >> col[i];
col[i]--;
dp[MASK(col[i])][i] = 1;
}
for (int i = 1; i <= m; ++i) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
}
void solve() {
for (int mask = 0; mask < MASK(k); ++mask) {
for (int u = 1; u <= n; ++u) {
if (dp[mask][u] == 0) continue;
for (int v : adj[u]) {
if (BIT(mask, col[v])) continue;
int nmask = mask + MASK(col[v]);
dp[nmask][v] += dp[mask][u];
}
}
}
ll res = 0;
for (int u = 1; u <= n; ++u)
for (int mask = 0; mask < MASK(k); ++mask)
if (__builtin_popcount(mask) >= 2)
res += dp[mask][u];
cout << res;
}
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
init();
solve();
return 0;
}
