#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=N*4+5,K=1000+5,mod=1e8+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,T,A[N],B[N],C[N];
int fa[N];
int GF(int x){return fa[x]^x?fa[x]=GF(fa[x]):x;}
vector<int> S[N],G[N];
int ns[N],nh,id[N];
int d[105][N],pt[105][N];
int dis[20][N],jp[20][N],st[N],sh;
vector<int> e[N];int ed[N];
int siz[N],dp[N],vis[N],cnt,rt;
void getsiz(int x,int La){
	siz[x]=1;
	for(int i:S[x]) if(i^La&&!vis[i]) getsiz(i,x),siz[x]+=siz[i];
}
void DP(int x,int La){
	dp[x]=cnt-siz[x];
	for(int i:S[x]) if(i^La&&!vis[i]) DP(i,x),dp[x]=max(dp[x],siz[i]);
	if(dp[x]<dp[rt]) rt=x;
}
void build(int x,int deep){
	getsiz(x,0);cnt=siz[x];dp[rt=0]=INF;DP(x,0);vis[x=rt]=1;
	queue<int> q;q.push(x);dis[deep][x]=0;
	while(!q.empty()){
		int y=q.front();q.pop();
		e[x].push_back(y);jp[deep][y]=x;
		for(int i:S[y]) if(!vis[i]&&dis[deep][i]>dis[deep][y]+1) dis[deep][i]=dis[deep][y]+1,q.push(i);
	}
	reverse(all(e[x]));
	for(int i:S[x]) if(!vis[i]) build(i,deep+1);
}
priority_queue<pair<ll,int> > Q;
ll ans[N],f[N];
void add(int x,int z,ll w){
	// gdb(x,z,w);
	for(int i=18;~i;i--) if(jp[i][x]){
		int v=jp[i][x];
		while(ed[v]>=0&&dis[i][e[v][ed[v]]]+dis[i][x]<=z){
			if(f[e[v][ed[v]]]>w){
				f[e[v][ed[v]]]=w;
				Q.emplace(-(w+B[e[v][ed[v]]]),e[v][ed[v]]);
				// gdb(x,z,i,v,dis[i][e[v][ed[v]]],dis[i][x],e[v][ed[v]]);
			}
			ed[v]--;
		}
	}
}
void work(){
	Me(f,0x3f);
	for(int i=1;i<=n;i++) ed[i]=e[i].size()-1;
	f[1]=0;Q.emplace(-B[1],1);
	while(!Q.empty()){
		auto [w,x]=Q.top();Q.pop();w*=-1;
		add(x,A[x],w);
		for(int i=1;i<=nh;i++) if(d[i][x]<=A[x]) add(ns[i],A[x]-d[i][x],w);
	}
	for(int i=1;i<=n;i++) ans[i]=min(ans[i],f[i]);
}
void Solve(){
	scanf("%d%d%d",&n,&m,&T);
	for(int i=1;i<=n;i++) scanf("%d%d%d",&A[i],&B[i],&C[i]);
	iota(fa+1,fa+n+1,1);
	for(int i=1;i<=m;i++){
		int x,y;scanf("%d%d",&x,&y);
		G[x].push_back(y);G[y].push_back(x);
		if(GF(x)^GF(y)) fa[GF(x)]=GF(y),S[x].push_back(y),S[y].push_back(x),gdb(x,y);
		else ns[++nh]=x,ns[++nh]=y;
	}
	sort(ns+1,ns+nh+1);nh=unique(ns+1,ns+nh+1)-ns-1;
	Me(d,0x3f);
	for(int i=1;i<=nh;i++){
		id[ns[i]]=i;
		d[i][ns[i]]=0;queue<int> q;
		q.push(ns[i]);
		for(int j=1;j<=n;j++){
			int x=q.front();q.pop();pt[i][j]=x;
			for(int j:G[x]) if(d[i][j]>d[i][x]+1) d[i][j]=d[i][x]+1,q.push(j);
		}
	}
	Me(dis,0x3f);
	build(1,0);
	Me(ans,0x3f);
	work();
	for(int i=1;i<=n;i++) B[i]+=(T-1)*C[i];
	work();
	for(int i=1;i<=n;i++) printf("%lld\n",ans[i]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}