#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include <cassert>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1005;
const int inf = 0x3f3f3f3f;

int n, m;
struct Edge {
	int to, val;
	Edge (int _to = 0, int _val = 0) :
		to(_to), val(_val) {}
};
vector<Edge> e[N];
int ind[N] = {0};
int idx[N] = {0};

void topo() {
	queue<int> q;
	for (int i = 1; i <= n; i++)
		if (ind[i] == 0)	
			q.push(i);
	int cur = 0;
	while (!q.empty()) {
		int h = q.front();
		q.pop();
		idx[h] = ++cur;
		for (auto i: e[h])
			if (--ind[i.to] == 0)
				q.push(i.to);
	}
	assert(cur == n);
}

vector<Edge> g[N];

int s1, t1, s2, t2;
int f[N][N] = {{0}};

int dfs(int x, int y) {
	if (x == y)
		return inf;
	if (x == s1 && y == s2)
		return 0;
	if (f[x][y] != -1)
		return f[x][y];
	f[x][y] = inf;
	if (y == s2 || (idx[x] > idx[y] && x != s1)) {
		//先移动 x
		for (auto i: g[x])
			f[x][y] = min(f[x][y], dfs(i.to, y) + i.val);  
	}
	else {
		for (auto i: g[y])
			f[x][y] = min(f[x][y], dfs(x, i.to) + i.val);
	}
//	cout << x << " " << y << " " << f[x][y] << endl;
	return f[x][y];
}
 
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1, u, v, w; i <= m; i++) {
		scanf("%d%d%d", &u, &v, &w);
		e[u].push_back(Edge(v, w));
		g[v].push_back(Edge(u, w));
		ind[v]++;
	}
	cin >> s1 >> t1 >> s2 >> t2;
	topo(); 
	memset(f, -1, sizeof f);
	int ans = dfs(t1, t2);
	if (ans != inf)
		cout << ans << endl;
	else
		cout << "NIE" << endl;
	return 0;
}