import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto M = RD;
	auto P = RD;
	auto edges = new long[2][][](N);
	foreach (i; 0..M)
	{
		auto A = RD-1;
		auto B = RD-1;
		auto C = RD - P;
		edges[A] ~= [B, C];
	}


	long Nloop;
	{
		long[2][] open = [[N-1, 0]];
		auto score = new long[](N);
		score[] = long.min;
		score[N-1] = 0;
		while (!open.empty)
		{
			auto n = open.front; open.popFront;
			auto from = n[0];
			auto s    = n[1];
			foreach (e; edges[from])
			{
				auto to = e[0];
				auto t  = e[1];
				auto ns = s + t;
				if (ns > score[to])
				{
					score[to] = ns;
					if (ns <= 10^^6)
						open ~= [to, ns];
				}
			}
		}
		Nloop = score[N-1];
	}

	if (Nloop > 0)
	{
		writeln(-1);
	}
	else
	{
		long[2][] open = [[0, 0]];
		auto score = new long[](N);
		score[] = long.min;
		score[0] = 0;
		while (!open.empty)
		{
			auto n = open.front; open.popFront;
			auto from = n[0];
			auto s    = n[1];
			foreach (e; edges[from])
			{
				auto to = e[0];
				auto t  = e[1];
				auto ns = s + t;
				if (ns > score[to])
				{
					score[to] = ns;
					if (ns <= 10^^6)
						open ~= [to, ns];
				}
			}
		}
		writeln(max(score[N-1], 0));
	}
	stdout.flush();
	debug readln();
}