#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma ("reroll")
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define all(a) a.begin(), a.end()
#define pb push_back
#define F first
#define S second
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 7;
const int MAX = 1e9;
const int inf = 1e18;
int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int n, m, k;
int a[N];
vector < int > g[N];
vector < int > ans;
set < vector < int > > s;
void dfs(int v, int p, int cnt){
ans.pb(v);
s.insert(ans);
if(cnt == k){
return;
}
for(int to : g[v]){
if(to == p){
skip;
}
dfs(to, v, cnt + 1);
ans.pop_back();
}
}
void solve() {
cin >> n >> m >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
for(int i = 1; i <= m; i++){
int u, v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
for(int i = 1; i <= n; i++){
dfs(i, i, 1);
ans.clear();
}
int otvet = 0;
for(auto x : s){
if(x.size() == 1) skip;
set < int > col;
for(int to : x){
col.insert(a[to]);
}
if(col.size() == x.size()) otvet++;
}
cout << otvet;
}
signed main() {
gold;
//freopen("rmq.in", "r", stdin);
//freopen("rmq.out", "w", stdout);
int t = 1;
int ti = 1;
//cin >> t;
while (t--) {
//cout << "Case " << ti << ": ";
solve();
ti++;
}
}
