#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());
// #define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
// const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 3 * 1e5 + 15;
const int maxK = 5;
int arr[maxN];
vector<int> g[maxN];
ll dp[maxN][1 << maxK];
void solve() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i], --arr[i];
for (int i = 1; i <= m; i++) {
int x, y; cin >> x >> y;
g[x].pb(y); g[y].pb(x);
}
for (int i = 1; i <= n; i++)
dp[i][1 << arr[i]] = 1;
for (int i = 0; i < (1 << k); i++) {
for (int j = 1; j <= n; j++) {
if ((i >> arr[j]) % 2 == 0) continue;
for (int k : g[j]) dp[j][i] += dp[k][(i ^ (1 << arr[j]))];
}
}
ll ans = 0;
for (int j = 0; j < (1 << k); j++) {
if (__builtin_popcount(j) <= 1) continue;
for (int i = 1; i <= n; i++) ans += dp[i][j];
} cout << ans << '\n';
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
// cout << '\n';
}
return 0;
}
