#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
typedef long long ll;
#define int ll
using namespace std;
const int N = 1e5+5;
vector<int> side[N];
int arr[N];
int tp[N];
int dep[N];
bool in[N];
int ans[N];
struct edge{
    int a,b,w;
};
void dfs(int cur,int p){
    for(auto i : side[cur]){
        if(i!=p){
            tp[i] = cur;
            dep[i]=dep[cur]+1;
            dfs(i,cur);
        }
    }
}
int P[N];
int P2[N];
int sz;
int query(int a){
    if(P[a]==a) return a;
    return P[a]=query(P[a]);
}

int query2(int a){
    if(P2[a]==a) return a;
    return P2[a]=query2(P2[a]);
}
bool inedge[2*N];
signed main(){
    AquA;
    int n,m;cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>arr[i];
    vector<edge> es;
    for(int i=0;i<m;i++){
        int a,b;cin>>a>>b;
        es.push_back({a,b,abs(arr[a]-arr[b])});
    }
    sort(es.begin(),es.end(),[](const edge &a,const edge &b){return a.w<b.w;});
    for(int i=1;i<=n;i++) P[i]=i;
    for(int i=0;i<m;i++){
        auto e = es[i];
        if(query(e.a)!=query(e.b)){
            P[query(e.a)]=query(e.b);
            inedge[i]=1;
            side[e.a].push_back(e.b);
            side[e.b].push_back(e.a);
        }
    }
    tp[1]=1;
    dep[1]=1;
    dfs(1,0);
    for(int i=1;i<=n;i++) P2[i]=i;
    for(int i=0;i<m;i++){
        if(inedge[i]) continue;
        if(query2(es[i].a)==query2(es[i].b)) continue;
        int a = query2(es[i].a);
        int b = query2(es[i].b);
        while(a!=b){
            if(dep[a]>dep[b]) swap(a,b);
            if(query2(tp[b])!=query2(b)){
                if(!in[b]) ans[b] = es[i].w;
                if(!in[tp[b]]) ans[tp[b]] = es[i].w;
                in[b]=1;
                in[tp[b]]=1;
                P2[query2(b)]=query2(tp[b]);   
            }
            b = query2(tp[b]);
        }
    }
    for(int i=1;i<=n;i++){
        if(!in[i]) cout<<-1<<" ";
        else cout<<ans[i]<<" ";
    }
    cout<<"\n";
}
/*
6 5 4 3
1 2 3 2 4 2
2 2 4 1 1
*/
/*
9 9 9 9 
8 6 4 1 9 7 5 3 2
1 2 3 4 5 6 7 8 9
*/
/*
20 20 18 8
8 9 1 17 18 2 11 17 15 12
9 16 8 13 17 15 16 9 8 17
15 16 2 16 16 8 2 5 5 5
10 12 11 10 12 3 2 13 8 4
*/