#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define N 500000
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int x,y,z,data,cl;
	bool operator < (const reads &t)const
	{
		return data!=t.data?data<t.data:cl<t.cl;
	}
};
reads ed[N+1];
int n,m,k,s,rt[N+1];
long long dst,wst;
bool used[N+1];
int find(int x)
{
	if (rt[x]==x) return x;
	return rt[x]=find(rt[x]);
}
void unionn(int x,int y)
{
	rt[x]=y;
	return;
}
long long F(int x)
{
	int rst=0;
	dst=wst=0;
	for (int i=1;i<=n;++i) rt[i]=i;
	for (int i=1;i<=m;++i)
	{
		if (ed[i].cl) ed[i].data=ed[i].z-x;
		else ed[i].data=ed[i].z;
	}
	sort(ed+1,ed+m+1);
	for (int i=1;i<=m;++i)
		if (find(ed[i].x)!=find(ed[i].y))
			unionn(find(ed[i].x),find(ed[i].y)),rst+=ed[i].cl,dst+=ed[i].data,wst+=ed[i].z;
	return rst;
}
int main()
{
	int res=-inf,cnt=0;
	n=read(),m=read(),k=read(),s=read();
	for (int i=1;i<=n;++i) rt[i]=i;
	for (int i=1;i<=m;++i)
	{
		ed[i].x=read(),ed[i].y=read(),ed[i].z=read();
		if (ed[i].x==s||ed[i].y==s) ed[i].cl=1;
		if (find(ed[i].x)!=find(ed[i].y)) unionn(find(ed[i].x),find(ed[i].y)),cnt++;
	}
	if (cnt!=n-1||k<F(-inf)||k>F(inf))
	{
		puts("nonnondayo");
		return 0;
	}
	for (int i=log(inf*2)/log(2);i>=0;--i)
		if (res+(1<<i)<=inf&&F(res+(1<<i))<=k)
			res+=(1<<i);
	F(res),printf("%lld\n",dst+1ll*res*k);
	return 0;
}