#include <cstdio>
#include <cstring>
#include <queue>
#include <iostream>
#include <vector>
using namespace std;
typedef pair <int, int> pin;const int N = 25005;
const int M = 2e5 + 5;
const int inf = 1e8;int n, m1, m2, st, tot = 0, head[N], dis[N];
int l = 1, r = 0, q[N], deg[N], sccCnt = 0, bel[N];
bool vis[N];
vector <int> scc[N];struct Edge {int to, nxt, val;
} e[M];inline void add(int from, int to, int val) {e[++tot].to = to;e[tot].val = val;e[tot].nxt = head[from];head[from] = tot;
}template <typename T>
inline void read(T &X) {X = 0; char ch = 0; T op = 1;for(; ch > '9'|| ch < '0'; ch = getchar())if(ch == '-') op = -1;for(; ch >= '0' && ch <= '9'; ch = getchar())X = (X << 3) + (X << 1) + ch - 48;X *= op;
}void dfs(int x) {bel[x] = sccCnt, scc[sccCnt].push_back(x);for(int i = head[x]; i; i = e[i].nxt) {int y = e[i].to;if(!bel[y]) dfs(y);}
}priority_queue <pin> Q;
void dij(int c) {for(unsigned int i = 0; i < scc[c].size(); i++) Q.push(pin(-dis[scc[c][i]], scc[c][i]));for(; !Q.empty(); ) {int x = Q.top().second; Q.pop();if(vis[x]) continue;vis[x] = 1;for(int i = head[x]; i; i = e[i].nxt) {int y = e[i].to;if(bel[y] == c) {if(dis[y] > dis[x] + e[i].val) {dis[y] = dis[x] + e[i].val;Q.push(pin(-dis[y], y));}} else {if(dis[y] > dis[x] + e[i].val) dis[y] = dis[x] + e[i].val;deg[bel[y]]--;if(!deg[bel[y]]) q[++r] = bel[y];    }}}
}int main() {read(n), read(m1), read(m2), read(st);for(int x, y, v, i = 1; i <= m1; i++) {read(x), read(y), read(v);add(x, y, v), add(y, x, v);}for(int i = 1; i <= n; i++)if(!bel[i]) ++sccCnt, dfs(i);for(int x, y, v, i = 1; i <= m2; i++) {read(x), read(y), read(v);add(x, y, v);deg[bel[y]]++;}for(int i = 1; i <= sccCnt; i++)if(!deg[i]) q[++r] = i;memset(dis, 0x3f, sizeof(dis)); dis[st] = 0;for(; l <= r; ++l) dij(q[l]);for(int i = 1; i <= n; i++) {if(dis[i] > inf) puts("NO PATH");else printf("%d\n", dis[i]);}return 0;
}