#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

bool dp[MAX][2];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,M,K;cin>>N>>M>>K;
    vector<array<ll,3>> E(M);
    for(int i=0;i<M;i++){
        ll a,b,c;cin>>a>>b>>c;a--;b--;
        K=gcd(K,(c*2)%K);
        E[i]={a,b,c};
    }
    vvll G(N);
    for(auto [a,b,c]:E){
        if(c%K==0){
            G[a].pb(mp(b,0));
            G[b].pb(mp(a,0));
        }else{
            G[a].pb(mp(b,1));
            G[b].pb(mp(a,1));
        }
    }
    dp[0][0]=true;
    queue<pii> Q;
    Q.push(mp(0,0));
    while(!Q.empty()){
        auto [u,f]=Q.front();Q.pop();
        for(auto [to,co]:G[u]){
            if(!dp[to][f^co]){
                Q.push(mp(to,f^co));
                dp[to][f^co]=true;
            }
        }
    }
    if(dp[N-1][0]) cout<<0<<"\n";
    else cout<<K/2<<"\n";
}