import java.util.ArrayList;
import java.util.Scanner;

public class Main {
    public static int T, R, P, S;
    public static ArrayList<edge>[] map;
    public static int[] distance;
    
    
    static class edge {
        public int a;  //边的起点
        public int b;  //边的终点
        public int v;  //边的权值
        
        public edge(int a, int b, int v) {
            this.a = a;
            this.b = b;
            this.v = v;
        }
    }
    
    @SuppressWarnings("unchecked")
    public void init() {
        map = new ArrayList[T + 1];
        distance = new int[T + 1];
        for(int i = 0;i <= T;i++) {
            map[i] = new ArrayList<edge>();
            distance[i] = Integer.MAX_VALUE;
        }
    }
    
    public void spfa() {
        ArrayList<Integer> town = new ArrayList<Integer>();
        distance[S] = 0;
        town.add(S);
        int[] count = new int[T + 1];
        boolean[] visited = new boolean[T + 1];
        count[S]++;
        visited[S] = true;
        while(town.size() != 0) {
            int start = town.get(0);
            town.remove(0);
            visited[start] = false;
            for(int i = 0;i < map[start].size();i++) {
                edge to = map[start].get(i);
                if(distance[to.b] > distance[start] + to.v) {
                    distance[to.b] = distance[start] + to.v;
                    if(!visited[to.b]) {
                        town.add(to.b);
                        visited[to.b] = true;
                        count[to.b]++;
                        if(count[to.b] > T)  //此时有负环出现
                            return;
                    }
                }
            }
        }
    }
    
    public void getResult() {
        spfa();
        for(int i = 1;i <= T;i++) {
            if(distance[i] == Integer.MAX_VALUE)
                System.out.println("NO PATH");
            else
                System.out.println(distance[i]);
        }
    }
    
    
    public static void main(String[] args) {
        Main test = new Main();
        Scanner in = new Scanner(System.in);
        T = in.nextInt();
        R = in.nextInt();
        P = in.nextInt();
        S = in.nextInt();
        test.init();
        for(int i = 1;i <= R;i++) {
            int a = in.nextInt();
            int b = in.nextInt();
            int v = in.nextInt();
            map[a].add(new edge(a, b, v));
            map[b].add(new edge(b, a, v));
        }
        for(int i = 1;i <= P;i++) {
            int a = in.nextInt();
            int b = in.nextInt();
            int v = in.nextInt();
            map[a].add(new edge(a, b, v));
        }
        test.getResult();
    }
}