from collections import defaultdict


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
from math import gcd
def main():
    n, m, k = list(map(int, input().split()))
    node = [[] for _ in range(n)]
    uf = UnionFind(n)
    E = []
    for _ in range(m):
        u, v, w = list(map(int, input().split()))
        u, v = u-1, v-1
        w %= k
        E.append((u, v, w))
        if uf.same(u, v): continue
        uf.union(u, v)
        node[u].append((v, w))
        node[v].append((u, w))
    D = [-1] * n
    D[0] = 0
    S = [0]
    while S:
        now = S.pop()
        for nxt, w in node[now]:
            if D[nxt] == -1:
                D[nxt] = (D[now]+w) % k
                S.append(nxt)
    a = 0
    for u, v, w in E:
        a = gcd(a, gcd(D[u]-D[v]+w, gcd(D[u]-D[v]-w, k)))
    #print(a)
    ans = D[-1]
    ans = ans - ans//a*a
    return ans
print(main())