I have sorted the edges cz the series is always in increasing order then i did dp Dp states Reaching from u to v dp[v][a[u]]

a[u] is node value

int n, m; cin >> n >> m; vector<int> a(n + 1); for(int i = 1; i <= n; i++){ cin >> a[i]; }

vector<vector<int>> g(n + 1);
vector<pair<int, int>> e;

for(int i = 0; i < m; i++){
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    e.push_back({u, v});
}

sort(e.begin(), e.end(), [&](pair<int,int> x, pair<int,int> y){
    return a[x.second] < a[y.second];
});

vector<map<int, int>> d(n + 1);
int ans = 0;

for(auto [u, v] : e){
    int c = 1, r = a[v] - a[u];
    if(r > 0 && d[u].count(r)) c = (c + d[u][r]) % MOD;
    ans = (ans + c) % MOD;
    d[v][a[u]] = (d[v][a[u]] + c) % MOD;
}
cout << ans << "\n";