/* Problem URL: https://codeforces.com/contest/2176/problem/D */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n, m;
    cin >> n >> m;
    vl a(n);
    cin >> a;

    const ll mod = 998244353;

    V<V<pair<ll, int>>> graph(n);
    vvl inv(n);

    while (m--) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        graph[u].emplace_back(a[v], v);
        inv[v].push_back(a[u]);
    }

    V<map<ll, vi>> act(n);

    rep(now, n) {
        sortv(graph[now]);
        sortv(inv[now]);
        inv[now].erase(unique(all(inv[now])), inv[now].end());

        repv(j, inv[now]) {
            auto itr = lower_bound(all(graph[now]), make_pair(j + a[now], -1));

            while (itr != graph[now].end() && itr->first == j + a[now]) {
                act[now][j].push_back(itr->second);
                itr++;
            }
        }
    }

    V<map<ll, ll>> memo(n);

    function<ll(int, ll)> dp = [&](int i, ll prev) {
        auto itr = memo[i].find(prev);
        if (itr != memo[i].end()) {
            return itr->second;
        }

        ll &ans = memo[i][prev];

        repv(j, act[i][prev]) {
            ans = (ans + dp(j, a[i]) + 1) % mod;
        }

        return ans;
    };

    ll ans = 0;
    rep(i, n) {
        repv(j, graph[i]) {
            ans = (ans + dp(j.second, a[i]) + 1) % mod;
        }
    }
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}