#include <bits/stdc++.h>

using namespace std;

using ld = long double;
const int N = 2e5 + 5;
struct Edge {
    int u, v, w;
    Edge(int u, int v, int w): u(u), v(v), w(w) {}
    bool operator < (const Edge &other) const {
        return w < other.w;
    }
};
vector<Edge> e;

struct Dsu {
    int par[N], rnk[N];
    void init() {
        for (int i = 1; i < N; ++i)
            par[i] = i, rnk[i] = 1;
    }
    int findParent(int u){
        return par[u] = (par[u] == u ? u : findParent(par[u]));
    }
    bool merge(int u, int v){
        u = findParent(u);
        v = findParent(v);
        if(u == v)return false;
        if(rnk[u] < rnk[v])
            swap(u,v);
        par[v] = u;
        rnk[u] += rnk[v];
        return true;
    }
};

int par[N];
int findPar(int u){
    return par[u] = (par[u] == u ? u : findPar(par[u]));
}
void init(){
    for(int i = 1; i < N; ++i)
        par[i] = i;
}
vector<int> adj[N];
int P[N], lvl[N];
void dfs(int u, int pr, int l){

    P[u] = pr;
    lvl[u] = l;
    for(auto &v: adj[u])
        if(v != pr)
            dfs(v, u,l + 1);
}
int main() {
    ios::sync_with_stdio(false); cout.tie(nullptr); cin.tie(nullptr);
    init();
    int n , m;
    cin >> n >> m;
    vector<int> h(n + 1);
    for(int i = 1; i <= n; ++i)
        cin >> h[i];
    for(int i = 0; i < m; ++i){
        int u, v, w;
        cin >> u >> v;
        w = abs(h[u] - h[v]);
        e.emplace_back(u,v,w);
    }
    sort(e.begin(), e.end());
    Dsu mst;
    mst.init();
    vector<Edge> notUsed;
    for(int i = 0; i < m; ++i){
        int u,v,w;
        u = e[i].u; v = e[i].v; w = e[i].w;
        if(!mst.merge(u,v)){ // merged before, so skip
            notUsed.emplace_back(e[i]);
        }else{
            adj[u].emplace_back(v);
            adj[v].emplace_back(u);
        }
    }

    dfs(1, 1, 0);
    vector<int> ans(n + 1, -1);
    for(int i = 0; i < notUsed.size(); ++i){
        Edge e = notUsed[i];
        if(ans[e.u] != -1 and ans[e.v] != -1)
            continue;
        if(ans[e.u] == -1 and ans[e.v] == -1){
            int u = e.u, v = e.v;
            int Limit = min(lvl[u], lvl[v]);
            if(lvl[u] < lvl[v])
                swap(u,v);
            while(lvl[u] < Limit){
                ans[u] = e.w;
                par[u] = findPar(P[u]);
                u = findPar(u);
            }
            while(u != v){
                ans[u] = ans[v] = e.w;
                par[u] = findPar(P[u]);
                par[v] = findPar(P[v]);
                u = findPar(u);
                v = findPar(v);
            }
            if(ans[u] == -1)
                ans[u] = e.w;

        }else if(ans[e.u] == -1){
            int u = e.u, v = findPar(e.v);
            while(ans[u] == -1){
                ans[u] = e.w;
                par[u] = findPar(P[u]);
                u = findPar(u);
            }
        }else {
            int u = findPar(e.u), v = e.v;
            while(ans[v] == -1){
                ans[v] = e.w;
                par[v] = findPar(P[v]);
                v = findPar(v);
            }
        }
    }
    for(int i = 1; i <= n; ++i)
        cout << ans[i] << ' ';

    return 0;
}