#include <bits/stdc++.h>

using namespace std;

int n,m;
int zap[100001];
vector<int>gr[100001];
map<pair<int,int>,bool >used;
void init()
{
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&zap[i]);
		gr[i].push_back(i);
	}
	int a,b;
	for(int i=0;i<m;i++)
	{
		scanf("%d %d",&a,&b);
		gr[a].push_back(b);
	}
}
int dfs(int start)
{
	bool flag=0;
	for(int i=0;i<gr[start].size();i++)
	{
		pair<int,int> tr;
		tr.first=start;
		tr.second=gr[start][i];
		if(used[tr]==0)
		{
			used[tr]=1;
			return max(zap[start],dfs(gr[start][i]));
			flag=1;
		}
	}
	if(!flag)return zap[start];
}
void solve()
{
	for(int i=1;i<=n;i++)
	{
		cout<<dfs(i)<<" ";
		used.clear();
	}
}
int main()
{
freopen("promotion.in", "r", stdin); 
freopen("promotion.out", "w" , stdout);
init();	
solve();
}