/*
* Author: Nonoze
* Created: Saturday 02/05/2026
*/
#include <bits/stdc++.h>
using namespace std;
#ifndef DEBUG
#define dbg(...)
#endif
// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")
#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;
void solve();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int tt=1;
// cin >> tt;
while(tt--) solve();
return 0;
}
int n, k, m, q;
vector<int> a;
vector<vector<int>> adj;
vector<vector<int>> memo;
int dp(int i, int mask) {
if (mask==(1<<k)-1) return 1;
if (memo[i][mask]!=-1) return memo[i][mask];
int ans=0;
for (auto &v: adj[i]) if ((mask&(1<<a[v]))==0) ans+=dp(v, mask+(1<<a[v]));
return memo[i][mask]=ans+1;
}
void solve() {
read(n, m, k);
a.resize(n); read(a); for (auto &u: a) u--;
adj.resize(n);
for (int i=0; i<m; i++) {
int u, v; read(u, v); u--, v--;
adj[u].pb(v), adj[v].pb(u);
}
memo.resize(n, vector<int>((1<<k), -1));
int ans=0;
for (int i=0; i<n; i++) ans+=dp(i, (1<<a[i]));
cout << ans-n << endl;
}
