// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v) memset(h, v, sizeof h)
#define Forv(i, a) for(auto& i : a)
#define For(i, a, b) for(int i = a; i <= b; ++i)
#define Ford(i, a, b) for(int i = a; i >= b; --i)
#define c_bit(i) __builtin_popcountll(i)
#define Bit(mask, i) ((mask >> i) & 1LL)
#define onbit(mask, i) ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
using namespace std;
namespace std {
template <typename T, int D>
struct _vector : public vector <_vector <T, D - 1>> {
static_assert(D >= 1, "Dimension must be positive!");
template <typename... Args>
_vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
};
template <typename T> struct _vector <T, 1> : public vector <T> {
_vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
};
template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 1e5 + 5;
const ll mod = 1e9 + 7;
const ll oo = 1e18;
#define int long long
int n, m, k, c[MAXN]; vector<int> g[MAXN];
ll dp[MAXN][(1 << 6) + 5];
void Solve() {
cin >> n >> m >> k;
For(i, 1, n) cin >> c[i], --c[i];
For(i, 1, m){
int u, v; cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
For(i, 1, n) dp[i][1 << c[i]] ++;
ll ans = 0;
For(s, 1, (1 << k) - 1) {
For(i, 1, n){
Forv(j, g[i]) {
if(Bit(s, c[j]) == 0){
ans -= dp[j][onbit(s, c[j])];
dp[j][onbit(s, c[j])] += dp[i][s];
ans += dp[j][onbit(s, c[j])];
}
}
}
}
cout << ans << '\n';
}
int32_t main() {
cin.tie(0) -> sync_with_stdio(0);
if(fopen("BOI18_paths.inp", "r")) {
freopen("BOI18_paths.inp", "r", stdin);
freopen("BOI18_paths.out", "w", stdout);
}
int t = 1;
// cin >> t;
for (int test = 1; test <= t; test++) {
Solve();
}
return 0;
}
