#include<bits/stdc++.h>
using namespace std;
vector<int>e[100001],g[100001];
int a[100001];
struct vertex{
    int id;
    long long dis;
    friend inline bool operator<(const vertex &a,const vertex &b)
    {
        return a.dis>b.dis;
    }
};
priority_queue<vertex>Q;
vector<long long>dis[2];
bool vis[100001];
inline void Dijkstra(int s,vector<long long>&dis)
{
    memset(vis,0,sizeof(vis));
    fill(dis.begin(),dis.end(),1e12);
    dis[s]=0;
    Q.push({s,0});
    while(!Q.empty())
    {
        auto [u,d]=Q.top();
        Q.pop();
        if(vis[u])
            continue;
        vis[u]=true;
        for(auto to: e[u])
        {
            long long nw=d+a[to];
            if(nw>dis[to])
            {
                dis[to]=nw;
                Q.push({to,nw});
            }
        }
    }
}
vector<pair<int,int>>Eset;
char ch[300001];
int in[300001];
int main(){
    int n,m,k;
    scanf("%d %d %d",&n,&m,&k);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    bool flg=false;
    for(int i=1;i<=m;i++)
    {
        int u,v;
        scanf("%d %d",&u,&v);
        e[u].push_back(v);
        e[v].push_back(u);
        flg|=(u==1&&v==n);
        flg|=(u==n&&v==1);
        Eset.push_back({u,v});
    }
    dis[0].resize(n+1);
    dis[1].resize(n+1);
    Dijkstra(1,dis[0]);
    Dijkstra(n,dis[1]);
    for(auto [u,v]: Eset)
    {
        if(dis[0][u]+dis[1][v]==dis[0][n])
            g[u].push_back(v),in[v]++;
        if(dis[0][v]+dis[1][u]==dis[0][n])
            g[v].push_back(u),in[u]++;
    }
    fill(ch+1,ch+n+1,'S');
    if(flg)
    {
        if(n==2&&k==1)
        {
            puts("impossible");
            return 0;
        }
        if(k>1)
        {
            ch[1]=ch[n]='N';
            k-=2;
            int now=2;
            while(k)
            {
                ch[now]='N';
                now++;
                k--;
            }
        }
        else if(k==1)
            ch[2]='N';
    }
    else
    {
        queue<int>Q;
        vector<int>ord;
        for(int i=1;i<=n;i++)
            if(!in[i]&&g[i].size())
                Q.push(i);
        while(!Q.empty())
        {
            int u=Q.front();
            Q.pop();
            ord.push_back(u);
            for(auto to: g[u])
            {
                in[to]--;
                if(!in[to])
                    Q.push(to);
            }
        }
        int comp=min(k,(int)ord.size());
        for(int i=0;i<comp;i++)
            ch[ord[i]]='N';
        for(int i=1;i<=n&&comp;i++)
            if(ch[i]=='S')
            {
                ch[i]='N';
                comp--;
            }
    }
    string ans="";
    for(int i=1;i<=n;i++)
        ans+=ch[i];
    cout<<ans<<endl;
    
    return 0;
}