#include <cstdio>
#include <span>
#include <vector>
constexpr int mod = 998244353;
auto three_membered_rings(std::span<std::vector<int>> adj) {
    auto n = adj.size();
    std::vector<size_t> rank(n);
    std::vector<int> vis_time(n);
    std::vector<std::vector<int>> f(n);
    for (int u = 0; u < n; ++u) {
        rank[u] = adj[u].size() * (n + 1) + u;
    }
    for (int u = 0; u < n; ++u) {
        for (auto v: adj[u]) {
            if (rank[u] < rank[v]) {
                f[u].push_back(v);
            }
        }
    }
    std::vector<std::tuple<int, int, int>> rings;
    for (int u = 0; u < n; ++u) {
        for (auto v: f[u]) {
            vis_time[v] = u;
        }
        for (auto v: f[u]) {
            for (auto w: f[v]) {
                if (vis_time[w] == u) {
                    rings.emplace_back(u, v, w);
                }
            }
        }
    }
    return rings;
}
int main() {
    int n, m;
    scanf("%d%d", &n, &m);
    std::vector<std::vector<int>> adj(n);
    std::vector<int> val(n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &val[i]);
    }
    for (int i = 0; i < m; ++i) {
        int u, v;
        scanf("%d%d", &u, &v);
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    auto rings = three_membered_rings(adj);
    long long sum = 0;
    for (auto [u, v, w]: rings) {
        sum = (sum + (long long) val[u] * val[v] % mod * val[w]) % mod;
    }
    printf("%lld\n", sum);

    return 0;
}