#include <bits/stdc++.h>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 3e5+5;
vector<int> adj[N];
int col[N], visited[6];
int ans = 0;
void dfs(int u){
visited[col[u]] = 1;
ans++;
for(auto v : adj[u]){
if(visited[col[v]]) continue;
int tmp = visited[col[v]];
visited[col[v]] = 1;
dfs(v);
visited[col[v]] = tmp;
}
}
signed main(){
fastio
int n,m,k;
cin >> n >> m >> k;
for(int i = 1;i <= n;i++){
cin >> col[i];
}
for(int i = 0;i < m;i++){
int u,v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
if(k==1){
cout << 0 << "\n";
return 0;
}else if(k==2){
cout << m*2 << "\n";
return 0;
}else if(k==3){
for(int i = 1;i <= n;i++){
int cnt1 = 0, cnt2 = 0;
for(auto v : adj[i]){
if(col[v] < col[i]) cnt1++;
else cnt2++;
}
ans += cnt1 + cnt2 + cnt1*cnt2*2;
}
cout << ans << "\n";
return 0;
}
}
