#include<bits/stdc++.h>
using namespace std;

#define int long long 
#define F first 
#define S second 
#define pb push_back
#define ld double
const int mol=998244353;

int dsu1[100005], dsu2[100005], a[100005], ans[100005], fa[100005];
vector<tuple<int, int, int>>mm;
vector<int>node[100005];
bool fi[100005], vv[100005];

int find1(int v){
    if(v==dsu1[v]) return v;
    return dsu1[v]=find1(dsu1[v]);
}

void un1(int g, int h){
    g=find1(g), h=find1(h);
    if(g==h) return;
    dsu1[g]=h;
}
int find2(int v){
    if(v==dsu2[v]) return v;
    return dsu2[v]=find2(dsu2[v]);
}

void un2(int g, int h){
    g=find2(g), h=find2(h);
    if(g==h) return;
    dsu2[g]=h;
}

int dep[100005];
void dfs(int v, int pre){
    dep[v]=dep[pre]+1;
    fa[v]=pre;
    for(int k: node[v]){
        if(k==pre) continue;
        dfs(k, v);
    }
}


void solve(){
    int n, m;
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i], dsu1[i]=i, dsu2[i]=i;
    for(int i=1;i<=m;i++){
        int g, h;
        cin>>g>>h;
        mm.pb({abs(a[g]-a[h]), g, h});
    }
    sort(mm.begin(), mm.end());

    for(int i=0;i<mm.size();i++){
        auto [t1, t2, t3]=mm[i];
        if(find1(t2)==find1(t3)){
            fi[i]=1;
        }
        else{
            node[t2].pb(t3);
            node[t3].pb(t2);
            un1(t2, t3);
        }
    }

    dfs(1, 1);
    for(int i=0;i<mm.size();i++){
        // cerr<<i<<"\n";
        if(fi[i]){
            auto [t1,t2,t3]=mm[i];
            if(!vv[t2]) ans[t2]=t1, vv[t2]=1;
            if(!vv[t3]) vv[t3]=1, ans[t3]=t1;
            while(find2(t2) != find2(t3)){
                if(dep[t2]<dep[t3]) swap(t2, t3);
                if(!vv[fa[t2]]) vv[fa[t2]]=1, ans[fa[t2]]=t1;
                un2(t2, fa[t2]);
                t2=find2(t2);
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(!vv[i]) cout<<"-1 ";
        else cout<<ans[i]<<" ";
    }
}

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    // int t;
    // cin>>t;
    // while(t--)
    solve();
    return 0;
}