#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;
vector<int> adj[MAXN];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n, m, k;
cin>>n>>m>>k;
int col[n+4];
for(int i= 1;i<=n;i++){
cin>>col[i];
col[i]--;
}
for(int i= 0;i<m;i++){
int t1, t2;
cin>>t1>>t2;
adj[t1].pb(t2);
adj[t2].pb(t1);
}
int dp[n+3][(1<<k)+3];
clr(dp, 0);
for(int i= 1;i<=n;i++){
dp[i][(1<<col[i])] = 1;
}
int ans= 0;
for(int mask = 0;mask<(1<<k);mask++){
for(int i= 1;i<=n;i++){
if((1<<col[i])&mask){
for(int v: adj[i]){
int newmask = (1<<col[v]) | mask;
if((1<<col[v]) & mask) continue;
dp[v][newmask] += dp[i][mask];
if(__builtin_popcount(newmask)>1){
ans += dp[i][mask];
}
}
}
}
}
cout<<ans<<endl;
return 0;
}
