#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 5005, M = 10005;
typedef pair<int, int> pi;
vector<int> g[N];
pii e[M];
ll w[M];
int pa[N], dep[N], low[N], _id;
vector<int> bcc[N], stk;
ll wd[N];
bool vis[N];

int go(int ei, int i) {
    return e[ei].first ^ e[ei].second ^ i;
}

void dfs(int i, int p) {
    dep[i] = low[i] = ~p ? dep[p] + 1 : 0;
    stk.pb(i), pa[i] = p, vis[i] = true;
    for (int ei : g[i]) if (go(ei, i) != p) {
        int j = go(ei, i);
        if (!vis[j]) {
            wd[j] = wd[i] + w[ei];
            dfs(j, i);
            low[i] = min(low[i], low[j]);
            if (low[j] >= dep[i]) {
                int id = _id++, x;
                do {
                    x = stk.back(), stk.pop_back();
                    bcc[x].push_back(id);
                } while (x != j);
                bcc[i].push_back(id);
            }
            else
                low[i] = min(low[i], dep[j]);
        }
    }
}

ll gcd(int i, int j) {return j ? gcd(j, i % j) : i;}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int x, y, z;
        cin >> x >> y >> z;
        --x, --y;
        g[x].push_back(i), g[y].push_back(i);
        e[i] = pi(x, y);
        w[i] = z;
    }
    for (int i = 0; i < n; ++i)
        if (!vis[i])
            dfs(i, -1);
    fill(vis, vis + n, false);
    vector<int> ord(n);
    iota(all(ord), 0);
    sort(all(ord), [&](int i, int j) {return dep[i] < dep[j];});
    ll ans = 0;
    for (int i : ord) {
        for (int ei : g[i]) {
            int j = go(ei, i);
            if (pa[j] != i && dep[j] > dep[i]) {
                vector<int> tmp;
                tmp.pb(i);
                tmp.pb(j);
                while (!vis[tmp.back()])
                    vis[tmp.back()] = true, tmp.pb(pa[tmp.back()]);
                ans = gcd(ans, gcd(w[ei] + wd[j] - wd[i], w[ei] + wd[j] - wd[tmp.back()] - (wd[tmp.back()] - wd[i])));
            }
        }
    }
    cout << abs(ans) << '\n';
}