#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()
void solve() {
int n,m,k;cin>>n>>m>>k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i], a[i]--;
vector<vector<int>> adj(n, vector<int>());
// bitmask of size k
vector<vector<vector<int>>> dp(n, vector<vector<int>>(k, vector<int>(1 << k)));
// cout << (1 << k) << endl;;
for (int i = 0; i < m; i++) {
int u,v;cin>>u>>v;u--;v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 0; i < n; i++) dp[i][0][1 << a[i]]++;
int ans = 0;
for (int j = 1; j < k; j++) {
for (int i = 0; i < n; i++) {
for (auto children : adj[i]) {
for (int mask = 0; mask < (1 << k); mask++) {
if (mask & (1 << a[i])) continue;
dp[i][j][mask | (1 << a[i])] += dp[children][j-1][mask];
}
}
}
}
for (int j = 1; j < k; j++) {
for (int i = 0; i < n; i++) {
for (int mask = 0; mask < (1 << k); mask++) {
ans += dp[i][j][mask];
}
}
}
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int t=1;
while(t--) solve();
return 0;
}
