#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
#define PII pair<int,int>
using namespace std;
const int N=25100,M=160000,inf=0x3f3f3f3f;
int h[N],e[M],w[M],ne[M],idx,n,s,cnt;
vector<int>block[N];
int dist[N],st[N],id[N],din[N];
queue<int>q;
void add(int a,int b,int c){
ne[idx]=h[a],e[idx]=b,w[idx]=c,h[a]=idx++;
}
void dijkstra(int bid){
priority_queue<PII,vector<PII>,greater<PII>>heap;
for(auto u:block[bid])
heap.push({dist[u],u});
while(heap.size()){
auto t=heap.top();
int ver=t.second;
heap.pop();
if(st[ver])continue;
st[ver]=true;
for(int i=h[ver];i!=-1;i=ne[i]){
int j=e[i];
if(id[ver]!=id[j]&&--din[id[j]]==0)q.push(id[j]);
if(dist[j]>dist[ver]+w[i]){
dist[j]=dist[ver]+w[i];
if(id[ver]==id[j])heap.push({dist[j],j});
}
}
}
}
void topsort()
{
memset(dist,0x3f,sizeof dist);
dist[s]=0;
for(int i=1;i<=cnt;i++)
if(!din[i])
q.push(i);
while(q.size()){
int t=q.front();
q.pop();
dijkstra(t);
}
}
void dfs(int u,int bid)
{
id[u]=bid;
block[bid].push_back(u);
for(int i=h[u];i!=-1;i=ne[i]){
int j=e[i];
if(!id[j])
dfs(j,bid);
}
}
int main()
{
memset(h,-1,sizeof h);
int r,p;
cin>>n>>r>>p>>s;
int a,b,c;
while(r--){
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);
add(b,a,c);
}
for(int i=1;i<=n;i++){
if(!id[i]){
cnt++;
dfs(i,cnt);
}
}
while(p--){
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);
din[id[b]]++;
}
topsort();
for(int i=1;i<=n;i++)
if(dist[i]>inf/2)puts("NO PATH");
else
cout<<dist[i]<<endl;
return 0;
}