#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define all(arr) (arr).begin(), (arr).end()
#define ll long long
#define ld long double
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define endl '\n'

const int N = 5e5 + 20;

vector<pair<int, int>> g[N];
ll dist[N];
int tin[N], timer = 1;

ll cand = 0;

void dfs(int v, int p){
  tin[v] = timer++;
  for (auto [u, w] : g[v]){
    if (!tin[u]){
      dist[u] = dist[v] + w;
      dfs(u, v);
    }
    else if (u != p && tin[u] < tin[v]){
      cand = __gcd(cand, dist[v] - dist[u] + w);
    }
  }
}

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  // cout.precision(20);
  int n, m;
  cin >> n >> m;
  while (m--){
    int a, b, w;
    cin >> a >> b >> w;
    g[a].pb({b, w});
    g[b].pb({a, w});
  }
  for (int i = 1; i <= n; i++){
    if (!tin[i]) dfs(i, i);
  }
  cout << cand << endl;
}