/*************************************
* author: Pham Huy Khanh *
*************************************/
#include <bits/stdc++.h>
#define ll long long
#define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; i++)
#define FOD(i,b,a) for (int i = (b), _a = (a); i >= _a; i--)
#define REP(i,n) for (int i = (0), _n = (n); i < _n; i++)
#define ALL(v) (v).begin(), (v).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(i) (1LL << (i))
#define CNTBIT(x) __builtin_popcountll(x)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define left ___left
#define right ___right
#define pii pair<int, int>
#define DEBUG(n, a) FOR (i, 1, n) cout << a[i] << ' '; cout << endl;
#define endl "\n"
using namespace std;
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y){ x = y; return true; } return false; }
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y){ x = y; return true; } return false; }
#define gogobruhbruh ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define file(name) if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
const int MOD = 1e9 + 7;
void sub(int &a, int b){ if ((a -= b) < 0) a += MOD; }
int muti(int a, int b){ return 1LL * a * b % MOD; }
int Pow(int x, int y){ int res = 1; for (; y; y >>= 1){ if (y & 1) res = muti(res, x); x = muti(x, x); } return res; }
const int MAX = 3e5 + 5;
const int INF = 1e9 + 7;
int numNode, numEdge, numCol;
int col[MAX];
ll dp[MAX][MASK(5)];
vector<int> edge[MAX];
bool vis[MAX][MASK(5)];
void dfs(int u, int mask){
vis[u][mask] = 1;
int nxt = mask ^ MASK(col[u]);
for (int v : edge[u]) if (BIT(nxt, col[v])){
if (!vis[v][nxt]) dfs(v, nxt);
dp[u][mask] += dp[v][nxt];
}
}
void solve(){
ll res = 0;
FOR (i, 1, numNode){
REP (j, MASK(numCol)) if (CNTBIT(j) > 1 && BIT(j, col[i])){
if (!vis[i][j]) dfs(i, j);
res += dp[i][j];
}
}
cout << res;
}
void read(){
cin >> numNode >> numEdge >> numCol;
FOR (i, 1, numNode) cin >> col[i], col[i]--, dp[i][MASK(col[i])] = 1;
FOR (i, 1, numEdge){
static int u, v;
cin >> u >> v;
if (col[u] == col[v]) continue;
edge[u].eb(v);
edge[v].eb(u);
}
}
int main(){
gogobruhbruh
file("main")
int test = 1;
// cin >> test;
while (test--)
read(),
solve();
}
