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

#ifdef DEBUG
#define fast
#else
#define fast cin.tie(0)->sync_with_stdio(0)
#define endl '\n'
#define cerr if(1);else cerr
#endif
#define _ <<' '<<
#define ALL(v) v.begin(),v.end()
#define ft first
#define sd second

using ll = long long;
using ld = long double;
using pii = pair<int,int>;

int dsu[100001], bcc[100001];

int fnd(int a,int *rr)
{
	return rr[a]=a==rr[a]?a:fnd(rr[a],rr);
}

bool unn(int a,int b,int *rr)
{
	a=fnd(a,rr);
	b=fnd(b,rr);
	if(a==b)
		return 0;
	rr[b]=a;
	return 1;
}

vector<int> G[100001];
int pp[100001], dep[100001];

void dfs(int a,int f)
{
	pp[a]=f;
	dep[a]=dep[f]+1;
	for(int b:G[a])
	{
		if(b==f)
			continue;
		dfs(b,a);
	}
}

int ans[1000001];
int arr[1000001];

signed main() {
	fast;
	
	int n,m;
	cin>>n>>m;
	vector<tuple<int,int,int> > edge;
	for(int i=1;i<=n;i++)
		cin>>arr[i], dsu[i]=bcc[i]=i, ans[i]=-1;
	for(int i=0;i<m;i++)
	{
		int a,b,c;
		cin>>a>>b;
		c=abs(arr[a]-arr[b]);
		edge.emplace_back(c,a,b);
	}
	sort(edge.begin(), edge.end());
	for(auto [c,a,b]:edge)
	{
		if(unn(a,b,dsu))
		{
			G[a].emplace_back(b);
			G[b].emplace_back(a);
		}
	}
	dfs(1,0);
	for(int i=1;i<=n;i++)
		dsu[i]=bcc[i]=i;
	for(auto [c,a,b]:edge)
	{
		cerr _ a _ b _ c _ endl;
		if(!unn(a,b,dsu))
		{
			while(fnd(a,bcc)!=fnd(b,bcc))
			{
				if(dep[a]<dep[b])
					swap(a,b);
				if(ans[a]==-1)
					ans[a]=c;
				if(ans[b]==-1)
					ans[b]=c;
				unn(a,pp[a],bcc);
				a=pp[a];
			}
		}
	}
	for(int i=1;i<=n;i++)
		cout<<ans[i]<<" \n"[i==n];
	
	cerr _ "meow" _ endl;
	
	return 0;
}