#include<iostream>
#include<fstream>
#include<bitset>
#include<vector>
#include<algorithm>
using namespace std;
bitset <100001> d;
vector <int> v[100001];
int p[100001],pretmin[100001];
inline int minim(int a, int b)
{
	if(a<=b)
		return a;
	return b;
}
inline int dfs(int nod)
{
	for(vector <int> :: iterator it=v[nod].begin();it!=v[nod].end();it++)
		if(d[*it]==0) 
			pretmin[nod]=minim(pretmin[nod],dfs(*it));
		else pretmin[nod]=minim(pretmin[nod],pretmin[*it]);
	d[nod]=1;
	return pretmin[nod];
}
int main ()
{
	int n,m,i,x,y;
	ifstream f("srevni.in");
	ofstream g("srevni.out");
	f>>n>>m;
	for(i=1;i<=n;i++) {
		f>>p[i];
		pretmin[i]=p[i];
	}
	for(i=1;i<=m;i++) {
		f>>x>>y;
		v[x].push_back(y);
	}
	for(i=1;i<=m;i++)
		sort(v[i].begin(),v[i].end());
	f.close();
	for(i=1;i<=n;i++)
		if(d[i]==0)
			pretmin[i]=minim(pretmin[i],dfs(i));
	for(i=1;i<=n;i++)
		g<<pretmin[i]<<" ";
	g.close();
	return 0;
}