#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#define maxv 25050
#define maxe 200050
#define inf 1000000000
using namespace std;
struct status
{
    int len,v;
    bool operator < (const status &x) const
    {
        return len>x.len;
    }
    status (int v,int len):v(v),len(len){}
    status () {}
};
int n,m1,m2,s,dis[maxv],d[maxv],father[maxv],g[maxv],nume=1,tot=0,x,y,z,bel[maxv];
vector <int> v[maxv],fr[maxv],to[maxv],w[maxv];
vector <status> bl[maxv];
map <int,int> mp;
queue <int> qr;
priority_queue <status> q;
struct edge
{
    int v,w,nxt;
}e[maxe];
void addedge(int u,int v,int w)
{
    e[++nume].v=v;
    e[nume].w=w;
    e[nume].nxt=g[u];
    g[u]=nume;
}
int getfather(int x)
{
    if (father[x]!=x) father[x]=getfather(father[x]);
    return father[x];
}
void unionn(int x,int y)
{
    int f1=getfather(x),f2=getfather(y);
    if (f1==f2) return;
    father[f2]=f1;
}
void dijkstra(int x)
{
    for (int i=0;i<bl[x].size();i++) dis[bl[x][i].v]=min(dis[bl[x][i].v],bl[x][i].len);
    for (int i=0;i<v[x].size();i++) if (dis[v[x][i]]!=inf) q.push(status(v[x][i],dis[v[x][i]]));
    while (!q.empty())
    {
        status head=q.top();q.pop();
        for (int i=g[head.v];i;i=e[i].nxt)
        {
            int v=e[i].v;
            if (dis[v]>dis[head.v]+e[i].w)
            {
                dis[v]=dis[head.v]+e[i].w;
                q.push(status(v,dis[v]));
            }
        }
    }
}
void topusort()
{
    for (int i=1;i<=tot;i++)
    {
        if (!d[i]) qr.push(i);
        bl[i].push_back(status(v[i][0],inf));
    }
    while (!qr.empty())
    {
        int head=qr.front();qr.pop();
        if (head==bel[s]) bl[bel[s]].push_back(status(s,0));
        dijkstra(head);
        for (int i=0;i<fr[head].size();i++)
        {
            if (dis[fr[head][i]]!=inf)
            {
                status now=status(to[head][i],dis[fr[head][i]]+w[head][i]);
                bl[bel[to[head][i]]].push_back(now);
            }
            if (!--d[bel[to[head][i]]]) qr.push(bel[to[head][i]]);
        }
    }
}
int main()
{
    scanf("%d%d%d%d",&n,&m1,&m2,&s);
    for (int i=1;i<=n;i++) {father[i]=i;dis[i]=inf;}
    for (int i=1;i<=m1;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        addedge(x,y,z);addedge(y,x,z);
        unionn(x,y);
    }
    for (int i=1;i<=n;i++)
    {
        int f=getfather(i);
        if (!mp[f]) mp[f]=++tot;
        bel[i]=mp[f];v[mp[f]].push_back(i);    
    }
    for (int i=1;i<=m2;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        fr[bel[x]].push_back(x);to[bel[x]].push_back(y);w[bel[x]].push_back(z);
        d[bel[y]]++;
    }
    topusort();
    for (int i=1;i<=n;i++)
    {
        if (dis[i]==inf) printf("NO PATH\n");
        else printf("%d\n",dis[i]);
    }
    return 0;
}