#include<bits/stdc++.h>
#define pb push_back
#define fir first
#define sec second
#define pii pair<int,int> 
#define umap unordered_map
#define ins insert
using namespace std;
const int N=1e5+5;
int n,m;
int a[N],deg[N];
vector<pii> g[N];
namespace Sub1{
	int used[N];
	inline void Main(){
		queue<int> q;
		int ans=0;
		for(int i=1;i<=n;++i)
			if(deg[i]==1)	q.push(i);
		while(!q.empty()){
			int x=q.front();q.pop();
			used[x]=1;
			for(pii p:g[x]){
				int v=p.fir;
				--deg[v];
				if(deg[v]==1)	q.push(v);
			}
		}
		for(int i=1;i<=n;++i){
			for(pii p:g[i]){
				int v=p.fir,w=p.sec;
				if(!used[i] && !used[v])
					ans=max(ans,w);
			}
		}
		for(int i=1;i<=n;++i){
			if(!used[i])	cout<<ans<<' ';
			else	cout<<"-1 ";
		}
		exit(0);
	}
}
namespace Sub2{
	inline void Main(){
		
		exit(0);
	}
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
//	freopen("cycle.in","r",stdin);
//	freopen("cycle.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;++i)	cin>>a[i];
	for(int i=1;i<=m;++i){
		int u,v;cin>>u>>v;
		g[u].pb({v,abs(a[u]-a[v])});
		g[v].pb({u,abs(a[u]-a[v])});
		deg[u]++,deg[v]++;
	}
	if(n==m)	Sub1::Main();
	Sub2::Main();
	return 0;
}