# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

class WeightedUnionFind:
    def __init__(self, n):
        self.n = n
        self.p = [*range(n)]
        self.w = [0] * n

    def leader(self, a):
        potential = 0
        while self.p[a] != a:
            self.w[a] += self.w[self.p[a]]
            potential += self.w[a]
            self.p[a] = a = self.p[self.p[a]]
        return a, potential

    def merge(self, a, b, d):
        """
        w[a] - w[b] = d
        """
        a,wa = self.leader(a)
        b,wb = self.leader(b)
        
        w = d + wa - wb
        if a == b:
            if w == 0: return 1
            else: return 0
        
        self.p[b] = a
        self.w[b] = w
        return 1
    
    def diff(self, a, b):
        a,wa = self.leader(a)
        b,wb = self.leader(b)
        if a == b:
            return True, wb - wa
        else:
            return False, -1


from math import gcd

n, m, k = MI()
g = k

uf = WeightedUnionFind(n)

for i in range(m):
    u, v, t = MI()
    u -= 1
    v -= 1
    f, w = uf.diff(u, v)
    if f == 1:
        g = gcd(g, w + t)
    else:
        uf.merge(u, v, t)
        g = gcd(g, 2 * t)

# print(uf.diff(0, n - 1), g)

print(uf.diff(0, n - 1)[1] % g)