// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int mod2=1e9+7;
const int maxn=25005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000005;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
int n,x,y,s,dist[maxn],cc[maxn],cnt;
bool vis[maxn];
vector<int> topo,child[maxn],adj2[maxn];
vector<pii> edge[maxn],adj[maxn],e;
void dfs(int u){
    cc[u]=cnt;child[cnt].push_back(u);
    for(pii v:edge[u]){
        if(cc[v.first]) continue;
        dfs(v.first);
    }
}
void dfs2(int u){
    vis[u]=true;
    for(int v:adj2[u]){
        if(!vis[v]) dfs2(v);
    }
    topo.push_back(u);
}
void solve(){
    cin >> n >> x >> y >> s;
    for(int i=1;i<=x+y;i++){
        int u,v,w;cin >> u >> v >> w;
        if(i<=x){
            edge[u].push_back({v,w});
            edge[v].push_back({u,w});
        }
        else{
            e.push_back({u,v});
            adj[u].push_back({v,w});
        }
    }
    for(int i=1;i<=n;i++){
        dist[i]=inf;
        if(!cc[i]){cnt++;dfs(i);}
    }
    for(pii x:e) adj2[cc[x.fi]].push_back(cc[x.se]);
    for(int i=1;i<=cnt;i++){
        if(!vis[i]) dfs2(i);
    }
    reverse(topo.begin(),topo.end());
    dist[s]=0;
    for(int cs:topo){
        priority_queue<pii,vector<pii>,greater<pii>> pq;
        for(int v:child[cs]){
            if(dist[v]!=inf) pq.push({dist[v],v});
        }
        while(!pq.empty()){
            int u=pq.top().se,d=pq.top().fi;pq.pop();
            if(dist[u]!=d) continue;
            for(pii v:edge[u]){
                if(dist[v.first]>d+v.second){
                    dist[v.first]=d+v.second;
                    pq.push({d+v.second,v.first});
                }
            }
        }
        for(int u:child[cs]){
            if(dist[u]==inf) continue;
            for(pii v:adj[u]) dist[v.first]=min(dist[v.first],dist[u]+v.second);
        }
    }
    for(int i=1;i<=n;i++){
        if(dist[i]==inf) cout << "NO PATH\n";
        else cout << dist[i] << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}