#include <bits/stdc++.h>
using namespace std;
typedef long long i64; 
const int N = 3e5 + 5; 

int n, m, k, a[N]; 
vector<int> G[N]; 
i64 f[N][1 << 5]; 

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n >> m >> k; 
    for (int i = 1; i <= n; ++i) cin >> a[i]; 
    while (m--) {
        int x, y; cin >> x >> y; 
        G[x].emplace_back(y); G[y].emplace_back(x); 
    }
    for (int i = 1; i < 1 << k; ++i) {
        if (i == (i & -i)) {
            for (int x = 1; x <= n; ++x)
                if (1 << a[x] - 1 == i) f[x][i] = 1; 
            continue; 
        }
        for (int x = 1; x <= n; ++x) if (i >> a[x] - 1)
            for (int y : G[x]) f[x][i] += f[y][i ^ (1 << a[x] - 1)]; 
    }
    i64 ans = 0; 
    for (int i = 1; i < 1 << k; ++i) if (i != (i & -i))
        for (int x = 1; x <= n; ++x) ans += f[x][i]; 
    cout << ans << '\n'; 
    return 0;
}