#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int n,m;
	ll k;
	cin>>n>>m>>k;
	ll c=k;
	vector<vector<pair<ll,int>>> graph(n);
	for(int i=0;i<m;i++){
		int u,v;
		ll t;
		cin>>u>>v>>t;
		c=gcd(c,2*t);
		u--;v--;
		graph[u].push_back(make_pair(t,v));
		graph[v].push_back(make_pair(t,u));
	}
	//cout<<c<<endl;
	{
		vector<int> depth(n,-1);
		vector<ll> d(n,-1);
		d[0]=0;
		auto dfs=[&](auto dfs,int v,ll val,int par,int dep)->void{
			depth[v]=dep;
			d[v]=val;
			for(auto[t,u]:graph[v]){
				if(par==u)continue;
				if(d[u]==-1){
					dfs(dfs,u,(val+t)%k,v,dep+1);
				}else{
					if(depth[u]<depth[v])c=gcd(c,val+t-d[u]);
					//cout<<val+t-d[u]<<endl;
				}
			}
		};
		dfs(dfs,0,0,-1,0);
	}
	vector<bool> seen(n);
	
	auto dfs=[&](auto dfs,int v,ll val)->void{
		seen[v]=true;
		if(v==n-1){
			cout<<val<<endl;
			return;
		}
		for(auto[t,u]:graph[v]){
			if(!seen[u])dfs(dfs,u,(val+t)%c);
		}
	};
	dfs(dfs,0,0);
}