/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 1e5 + 5, LG = 18, MOD = 1e9 + 7;
const long double PI = acos(-1);
const long double EPS = 1e-7;
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
int from[N], to[N], wt[N];
vector<array<int, 3>> adj[N];
int par[N], edgeParent[N];
bool vis[N];
int lvl[N];
ull cycles[N];
ull cycleEdges[N];
ll ans;

void dfs(int node) {
    vis[node] = true;
    for (auto [v, w, i]: adj[node]) {
        if (v == par[node])continue;
        if (!vis[v]) {
            lvl[v] = lvl[node] + w;
            edgeParent[v] = i;
            par[v] = node;
            dfs(v);
            cycles[node] ^= cycles[v];
        } else if (lvl[v] < lvl[node]) {
            ull add = mrand();
            cycles[node] ^= add;
            cycles[v] ^= add;
            cycleEdges[i] ^= add;
            ans = __gcd(ans, lvl[node] - lvl[v] + w);
        }
    }

}

void doWork() {


    cin >> n >> m;
    f(i, 0, m) {
        cin >> from[i] >> to[i] >> wt[i];
        adj[from[i]].pb({to[i], wt[i], i});
        adj[to[i]].pb({from[i], wt[i], i});
    }

    for (int i = 1; i <= n; i++)
        if (!vis[i])
            dfs(i);
    for (int i = 1; i <= n; i++)
        if (par[i]) {
            cycleEdges[edgeParent[i]] ^= cycles[i];
        }
    map<ull, ll> mp;
    f(i, 0, m) {
        mp[cycleEdges[i]] += wt[i];
    }
    for (auto [k, v]: mp)ans = __gcd(ans, 2 * v);

    cout << ans << '\n';

}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}