#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;

int m,n,d[100001],pred[100001],s,lim;
const int N=1<<17;
vector<int> cost[N],a[N];
queue<int> q;

void citire()
{
	int x,y,i,c;
	scanf("%d %d %d %d",&lim,&s,&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d %d",&x,&y,&c);
		a[x].push_back(y);
		cost[x].push_back(c);
	}
}

int main()
{
	int i,x,y;
	freopen("bf.in","r",stdin);
	freopen("bf.out","w",stdout);
	
	citire();
	
	q.push(s);
	for(i=1;i<=n;i++)
		d[i]=N;
	d[s]=0;
	
	while(!q.empty())
	{
		x=q.front();
		q.pop();
		for(size_t i=0;i<a[x].size();++i)
		{
			y=a[x][i];
			if(d[x]+cost[x][i]<d[y])
			{
				q.push(y);
				d[y]=d[x]+cost[x][i];
			}
		}
	}
	
	for(i=1;i<=n;i++)
		printf("%d ",d[i]);
	
}