#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ps push
#define in insert
#define f first
#define s second
#define nl cout<<"\n"
#define ca(v) for(auto i:v) cout<<i<<" ";
#define cbit(x) __builtin_popcount(x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a*b/gcd(a, b))
const int xm[4] = {-1, 1, 0, 0};
const int ym[4] = {0, 0, -1, 1};
const int MOD = 1e9 + 7;
const int MAXN = 5e5 + 5;
const ll POW = 9973;

#define FOR(i,a,b) for(int i=a;i<b;i++)
#define For(i,a) FOR(i,0,a)
#define vi vector<int>
#define vl vector<ll>
#define trav(a,b) for(auto& a:b)
#define pi pair<int,int>
#define vpi vector<pi>

const int MX = 5e4+5;

vl v;
vpi adj[MX];
ll dep[MX];
bool vis[MX];

ll gcd2(ll a , ll b)
{
   if(b==0) return a;
   a%=b;
   return gcd2(b,a);
}

void dfs(int n, int p) {
    // cout << n << " " << p << endl;
    vis[n] = true;
    trav(x, adj[n]) {
        if (x.f!=p) {
            if (vis[x.f]) {
                ll len = abs(dep[n] - dep[x.f]) + x.s;
                // cout << len << " " << n << endl;
                v.pb(len);
            } else {
                dep[x.f] = dep[n] + x.s;
                dfs(x.f,n);
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) {
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }
    int n,m;cin>>n>>m;
    For(i,m) {
        int a,b,c;cin>>a>>b>>c;
        a--;b--;
        adj[a].pb({b,c});
        adj[b].pb({a,c});
    }
    dfs(0,0);
    // trav(x,v) {
    //     cout << x << endl;
    // }

    ll ans = 0;
    if (v.size()) {
        ans = v[0];
    }
    trav(x,v) {
        ans = gcd2(ans, x);
    }
    cout << ans << endl;

}