#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<stack>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
using namespace std;

#define official

#ifdef official
#define cin inF
#define cout outF
#endif

ifstream inF("promotion.in");
ofstream outF("promotion.out");

const int MAX_N=100100;
vector<int> ne[MAX_N];
long long s[MAX_N];
int w[MAX_N];
long long maxs[MAX_N];
int n,m;

void input()
{
    cin>>n>>m;
    int a,b;
    for (int i=0;i<n;++i)
    {
        cin>>s[i];
    }
    for (int i=0;i<m;++i)
    {
        cin>>a>>b;
        --a;
        --b;
        ne[b].push_back(a);
    }
}
void output()
{
    for (int i=0;i<n;++i)
    {
        cout<<maxs[i]<<' ';
    }
    cout<<'\n';
}
bool cmp(int a, int b)
{
    return s[a]>s[b];
}
void DFS(int a, long long cs)
{
    maxs[a]=cs;
    for (int i=0;i<ne[a].size();++i)
    {
        if (maxs[ne[a][i]]==-1) DFS(ne[a][i],cs);
    }
}
void solve()
{
    for (int i=0;i<n;++i)
    {
        w[i]=i;
        maxs[i]=-1;
    }
    sort(w,w+n,cmp);
    for (int i=0;i<n;++i)
    {
        if (maxs[w[i]]==-1) DFS(w[i],s[w[i]]);
    }
}

int main()
{
    input();
    solve();
    output();

    return 0;
}