#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
vector<pair<int, int>> adj[N];
int vis[N], dep[N];
ll ans = 0;

void dfs(int u, int p, ll d) {
	vis[u] = 1;
	for (auto [v, w]: adj[u]) {
		if (vis[v]) {
			if (dep[u] > dep[v] && v != p)
				ans = gcd(ans, d + w);
			continue;
		}
		dep[v] = dep[u] + 1;
		dfs(v, u, d + w);
	}
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n, m; cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int u, v, w; cin >> u >> v >> w;
		u--, v--;
		adj[u].push_back({v, w});
		adj[v].push_back({u, w});
	}
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	for (int i = 0; i < n; i++)
		shuffle(adj[i].begin(), adj[i].end(), rng);
	for (int i = 0; i < n; i++) {
		fill(vis, vis + n, 0);
		fill(dep, dep + n, 0);
		dfs(i, -1, 0);
		break;
	}
	cout << ans << "\n";
}