#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()
clock_t startTime;
double getCurrentTime() {
return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}
#define MP make_pair
typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 3e5 + 3e2;
const int M = 222;
int cnt[N][10];
int color[N];
vector<int> g[N];
void solve(int TC) {
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++){
cin >> color[i];
}
vector<pair<int, int>> edges;
ll ans = 0;
for (int i = 1; i <= m; i++){
int a, b;
cin >> a >> b;
ans += 2 * (color[a] != color[b]);
cnt[a][color[b]]++;
cnt[b][color[a]]++;
g[a].push_back(b);
g[b].push_back(a);
edges.emplace_back(a, b);
}
if (k == 1){
cout << 0;
return;
}
if (k == 2){
cout << ans;
return;
}
debug(ans);
for (int i = 1; i <= n; i++){
for (int x = 1; x <= k; x++){
for (int y = 1; y <= k; y++){
set<int> s = {color[i], x, y};
if (s.size() == 3) ans += 1ll * cnt[i][x] * cnt[i][y];
}
}
}
debug(ans);
if (k == 3){
cout << ans;
return;
}
for (auto edge : edges){
int i = edge.first, j = edge.second;
for (int x = 1; x <= k; x++){
for (int y = 1; y <= k; y++){
set<int> s = {color[i], color[j], x, y};
if (s.size() == 4) ans += 2ll * cnt[i][x] * cnt[j][y];
}
}
}
debug(ans);
if (k == 4) {
cout << ans;
return;
}
for (int i = 1; i <= n; i++){
vector<vector<int>> vv(6, vector<int>(6, 0));
for (int j : g[i]){
for (int x = 1; x <= 5; x++){
vv[color[j]][x] += cnt[j][x];
}
}
for (int a = 1; a <= 5; a++){
for (int b = 1; b <= 5; b++){
for (int c = 1; c <= 5; c++){
for (int d = 1; d <= 5; d++){
set<int> s = {color[i], a, b, c, d};
if (s.size() == 5) ans += 1ll * vv[a][b] * vv[c][d];
}
}
}
}
}
debug(ans);
cout << ans;
}
int main() {
startTime = clock();
cin.tie(nullptr); cout.tie(nullptr);
ios_base::sync_with_stdio(false);
bool llololcal = false;
#ifdef dddxxz
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
llololcal = true;
#endif
int TC = 1;
//cin >> TC;
for (int test = 1; test <= TC; test++) {
//debug(test);
//cout << "Case #" << test << ": ";
solve(test);
}
if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
return 0;
}
