#include <bits/stdc++.h>
#define X first
#define Y second
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=10010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int n, m;
vector < pii > v[N];
ll dep[N], d;

ll gcdl(ll A, ll B) {
    if(!B) return A;
    return gcdl(B, A % B);
}

void dfs(int x, int lst) {
	for(pii tmp : v[x]) {
		if(tmp.Y == lst) continue;
		if(dep[tmp.Y] != -1 && dep[tmp.Y] < dep[x]) {
			d = gcdl(dep[x] - dep[tmp.Y] + tmp.X, d);
		} else if(dep[tmp.Y] == -1) {
			dep[tmp.Y] = dep[x] + tmp.X;
			dfs(tmp.Y, x);
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	memset(dep, -1, sizeof(dep));
	cin >> n >> m;
	vector < int > cv;
	for(int i = 1;i <= n;i++) cv.pb(i);
	for(int i = 0;i < m;i++) {
		int a, b, c; cin >> a >> b >> c;
		v[a].pb({c, b});
		v[b].pb({c, a});
	}
   for(int j = 0;j < 10000;j++) {
        memset(dep, -1, sizeof(dep));
        for(int x : cv) {
            if(dep[x] != -1) continue;
            dep[x] = 0; dfs(x, x);
        }
    }
	cout << d << endl;
}