#include<bits/stdc++.h>
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define ll long long
#define lll __int128
#define fi first
#define se second
#define e emplace
#define eb emplace_back
#define db double
#define ef emplace_front
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vp vector<pii>
#define vt vector<tup>
#define all(x) x.begin(),x.end()
#define mp make_pair

#define FastI
#define FastO
#define int ll
bool ST;
static const ll MOD=1e8+7,Phi=998244352,inv2=499122177,Root=3,iRoot=332748118;
static const ll inf=1073741823,Inf=4294967296,INF=4557430888798830399;
static const ld eps=1e-9,pi=3.1415926535;
char in[1<<20],*p1=in,*p2=in;
char out[1<<20],*p3=out;
using namespace std;
struct tup
{
	int x,y,z;
	tup(int X=0,int Y=0,int Z=0)
	{x=X,y=Y,z=Z;}
};
#ifdef FastI
#define getchar() (p1==p2&&(p2=(p1=in)+fread(in,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#endif
#ifdef FastO
#define putchar(x) (p3-out==1<<20?fwrite(out,1,1<<20,stdout),p3=out,0:0,*p3++=x)
#define puts(x) write(x,'\n')
#endif
namespace FastIO
{
	template<typename T> inline void write(T x,char ch=' ')
	{
		if(is_same<char,T>::value)putchar(x);
		else
		{
			if(x<0)x=-x,putchar('-');
			static char st[25];
			int top=0;
			do st[top++]=x%10+'0',x/=10;while(x);
			while(top)putchar(st[--top]);
		}
		ch!='~'?putchar(ch):0;
	}
	inline void write(const char*x,char ch=' ')
	{
		for(int i=0;x[i]!='\0';++i)putchar(x[i]);
		ch!='~'?putchar(ch):0;
	}
	inline void read(char&s){do s=getchar();while(s=='\n'||s==' ');}
	inline void read(char s[])
	{
		int len=0;char st;
		do st=getchar();while(st=='\n'||st==' ');
		s[++len]=st,st=getchar();
		while(st!='\n'&&st!=' ')s[++len]=st,st=getchar();
		s[++len]='\0';
	}
	template<typename T> inline void read(T &s)
	{
		char ch=getchar();s=0;
		while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
		bool tf=(ch=='-'&&(ch=getchar()));
		while(ch>='0'&&ch<='9')s=(s<<1)+(s<<3)+ch-'0',ch=getchar();
		s=tf?-s:s;
	}
	inline void edl(){putchar('\n');}
	template<typename T1,typename T2> inline void read(pair<T1,T2> &s){read(s.fi),read(s.se);}
	template<typename T,typename...Args> inline void write(T x,Args...args){write(x,'~'),write(args...);}
	template<typename T,typename...Args> inline void read(T&x,Args&...args){read(x),read(args...);}
	#ifdef FastO
	struct Writer{~Writer(){fwrite(out,1,p3-out,stdout);}}Writ;
	#endif
}
using namespace FastIO;
namespace MTool
{
	inline int Cadd(int a,int b){return (ll)a+b>=MOD?(ll)a+b-MOD:a+b;}
	inline int Cdel(int a,int b){return a-b<0?a-b+MOD:a-b;}
	inline int Cmul(int a,int b){return 1ll*a*b%MOD;}
	inline int sqr(int a){return 1ll*a*a%MOD;}
	inline void Madd(int&a,int b){a=((ll)a+b>=MOD?(ll)a+b-MOD:a+b);}
	inline void Mdel(int&a,int b){a=(a-b<0?a-b+MOD:a-b);}
	inline void Mmul(int&a,int b){a=1ll*a*b%MOD;}
	inline int Cmod(int x){return (x%MOD+MOD)%MOD;}
	inline void Mmod(int&x){x=(x%MOD+MOD)%MOD;}
	template<typename T> inline bool Mmax(T&a,T b){return a<b?a=b,1:0;}
	template<typename T> inline bool Mmin(T&a,T b){return a>b?a=b,1:0;}
	template<typename...Args> inline void Madd(int&a,int b,Args...args){Madd(a,b),Madd(a,args...);}
	template<typename...Args> inline void Mmul(int&a,int b,Args...args){Mmul(a,b),Mmul(a,args...);}
	template<typename...Args> inline void Mdel(int&a,int b,Args...args){Mdel(a,b),Mdel(a,args...);}
	template<typename...Args> inline int Cadd(int a,int b,Args...args){return Cadd(Cadd(a,b),args...);}
	template<typename...Args> inline int Cmul(int a,int b,Args...args){return Cmul(Cmul(a,b),args...);}
	template<typename...Args> inline int Cdel(int a,int b,Args...args){return Cdel(Cdel(a,b),args...);}
	template<typename...Args,typename T> inline bool Mmax(T&a,T b,Args...args){return Mmax(a,b)|Mmax(a,args...);}
	template<typename...Args,typename T> inline bool Mmin(T&a,T b,Args...args){return Mmin(a,b)|Mmin(a,args...);}
	inline int power(int x,int y){int s=1;for(;y;y>>=1,Mmul(x,x))if(y&1)Mmul(s,x);return s;}
}
using namespace MTool;
namespace WrongAnswer_90
{
	int n,m,TT,f[200010],c[200010],w[200010];
	int dep[21][200010],rdep[200010];
	int d[110][200010];
	int ans[200010];
	int all,rt,minn,siz[200010];
	int fa[200010];
	int up[200010];
	bool vis[200010],ins[200010];
	int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
	vi T[200010],G[200010],ve,qu[200010],qu2[110];
	priority_queue<pii> Q;
	void findrt(int x,int fa)
	{
		int maxn=0;
		ins[x]=0,siz[x]=1;
		for(auto to:T[x])if(to!=fa&&!vis[to])
		findrt(to,x),Mmax(maxn,siz[to]),siz[x]+=siz[to];
		if(Mmin(minn,max(maxn,all-siz[x])))rt=x;
	}
	int starch(int x,int dp=1)
	{
		minn=inf,findrt(x,0),x=rt,findrt(rt,0);
		rdep[x]=dp,vis[x]=1;
		cerr<<x<<" "<<dp<<endl;
		queue<int> q;q.e(x);
		while(!q.empty())
		{
			int nw=q.front();q.pop();
			ins[nw]=1;
			qu[x].eb(nw);
			for(auto to:T[nw])if(!ins[to]&&!vis[to])
			q.e(to),dep[dp][to]=dep[dp][nw]+1;
		}
		reverse(qu[x].begin(),qu[x].end());
		for(auto to:T[x])if(!vis[to])all=siz[to],up[starch(to,dp+1)]=x;
		return x;
	}
	inline pii get()
	{
		while(1)
		{
			int nw=Q.top().se,tmp=nw;
//			cerr<<nw<<endl;
//			exit(0);
			while(tmp)
			{
				while(qu[tmp].size()&&vis[qu[tmp].back()])qu[tmp].pop_back();
//				cerr<<tmp<<" "<<(qu[tmp].size()?qu[tmp].back():-1)<<endl;
//				if(qu[tmp].size())cerr<<"???"<<rdep[tmp]<<" "<<dep[rdep[tmp]][qu[tmp].back()]<<" "<<
//				dep[rdep[tmp]][nw]<<" "<<f[nw]<<endl;
				if(qu[tmp].size()&&dep[rdep[tmp]][qu[tmp].back()]
				+dep[rdep[tmp]][nw]<=f[nw])
				return cerr<<Q.top().se<<":",mp(qu[tmp].back(),-Q.top().fi);
				tmp=up[tmp];
			}
			for(int i=0;i<(int)ve.size();++i)
			{
				while(qu2[i].size()&&vis[qu2[i].back()])qu2[i].pop_back();
				if(qu2[i].size()&&d[i][qu2[i].back()]+d[i][nw]<=f[nw])
				return cerr<<Q.top().se<<":", mp(qu2[i].back(),-Q.top().fi);
			}
			Q.pop();
		}
	}
	void solve()
	{
		for(int i=1;i<=n;++i)qu[i].clear();
		memset(d,127,sizeof(d));
		for(int i=0;i<(int)ve.size();++i)
		{
			qu2[i].clear();
			queue<int> q;
			d[i][ve[i]]=0,q.e(ve[i]);
			while(!q.empty())
			{
				int nw=q.front();q.pop();
				qu2[i].eb(nw);
				for(auto to:G[nw])
				{
					if(Mmin(d[i][to],d[i][nw]+1))
					q.e(to);
				}
			}
			reverse(qu2[i].begin(),qu2[i].end());
//			write(ve[i],'\n');
//			for(auto p:qu2[i])write(p);puts("");
//			for(int j=1;j<=n;++j)write(d[i][j]);puts("");
//			puts("");
		}
//		exit(0);
		memset(vis,0,sizeof(vis));
		all=n,starch(1);
//		for(int i=1;i<=n;++i)write(rdep[i]);puts("");
//		for(int i=1;i<=20;++i,puts(""))
//		for(int j=1;j<=n;++j)write(dep[i][j]);
//		exit(0);
//		for(int i=1;i<=n;++i)write(up[i]);puts("");
//		for(int i=1;i<=n;++i)
//		{
//			write(i,'\n');
//			for(auto p:qu[i])write(p);puts("");
//		}
//		exit(0);
		while(!Q.empty())Q.pop();
		Q.e(mp(-c[1],1));
		memset(vis,0,sizeof(vis)),vis[1]=1;
		for(int i=2;i<=n;++i)
		{
			pii nw=get();
			cerr<<i<<" "<<nw.fi<<" "<<nw.se<<endl;
			vis[nw.fi]=1;
			Mmin(ans[nw.fi],nw.se);
			Q.e(mp(-nw.se-c[nw.fi],nw.fi));
		}
	}
	inline void mian()
	{
		read(n,m,TT);int x,y;
		for(int i=1;i<=n;++i)read(f[i],c[i],w[i]),fa[i]=i;
		for(int i=1;i<=m;++i)
		{
			read(x,y);
			G[x].eb(y),G[y].eb(x);
			if(find(x)==find(y)){ve.eb(x),ve.eb(y);continue;}
			T[x].eb(y),T[y].eb(x);
			fa[find(x)]=find(y);
		}
		sort(ve.begin(),ve.end());
		ve.resize(unique(ve.begin(),ve.end())-ve.begin());
		memset(ans,127,sizeof(ans));
		solve();
		for(int i=1;i<=n;++i)c[i]=c[i]+w[i]*(TT-1);
//		for(int i=1;i<=n;++i)cerr<<c[i]<<" ";
//		exit(0);
		solve();
		ans[1]=0;
		for(int i=1;i<=n;++i)write(ans[i],'\n');
	}
	inline void Mian()
	{
		int T=1;
//		read(T);
		while(T--)mian();
	}
}
bool ED;
signed main()
{
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	double st=clock();
	WrongAnswer_90::Mian();
	double ed=clock();
 	cerr<<endl;
 	cerr<<"Time: "<<ed-st<<" ms\n";
 	cerr<<"Memory: "<<abs(&ST-&ED)/1024.0/1024.0<<" MB\n";
	return 0;
}