E-Skiing 100

#include<bits/stdc++.h>
using namespace std;
const int N=200005;
int n,m,a[N],d[N];
priority_queue<int>q;
vector<int>e[N];
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=m;i++)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        e[u].push_back(v);
        e[v].push_back(u);
    }
    for(int i=1;i<=n;i++)
        q.push(i);
    while(q.size())
    {
        int u=q.top();
        q.pop();
        for(auto v:e[u])
        {
            int c;
            if(a[v]>a[u])
                c=a[v]-a[u];
            else
                c=2*(a[v]-a[u]);
            c+=d[u];
            if(c>d[v])
            {
                d[v]=c;
                q.push(v);
            }
        }
    }
    printf("%d\n",d[1]);
    return 0;
}