#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
int n, m, dep[maxn], val[maxn], ans, head[maxn], tot, vis[maxn], W[maxn];
map<int, int> mp;
struct node {
	int v, pre, w, id;
}e[maxn << 1];
mt19937 rnd(time(0));
void add(int u, int v, int w, int id) {
	e[++ tot].v = v;
	e[tot].w = w;
	e[tot].id = id;
	e[tot].pre = head[u];
	head[u] = tot;
}
void dfs(int now, int las) {
//	cout << now << " " << las << endl;
	vis[now] = 1;
	for(int i = head[now];i;i = e[i].pre) {
		int v = e[i].v;
		if(e[i].id == las) continue;
		if(!vis[v]) {
			dep[v] = dep[now] + e[i].w;
			dfs(v, e[i].id);
			val[now] ^= val[v];
		}
		else if(dep[v] < dep[now]){
//			cout << now << " " << v << " " << dep[now] << " " << dep[v] << " " << e[i].id << " " << las << endl;
			ans = __gcd(ans, dep[now] - dep[v] + e[i].w);
			int t = rnd();
			mp[t] += e[i].w;
			val[now] ^= t, val[v] ^= t;
		}
	}
	if(las) {
		mp[val[now]] += W[las];
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for(int i = 1, u, v, w;i <= m;i++) {
		cin >> u >> v >> w;
		W[i] = w;
		add(u, v, w, i), add(v, u, w, i);
	}
	for(int i = 1;i <= n;i++) if(!vis[i]) dfs(i, 0);
	for(pair<int, int> t : mp) if(t.first) ans = __gcd(ans, 2 * t.second);
	cout << ans;
}