#define taskname "C"
#include <bits/stdc++.h>
#define int long long
#define ii pair<int,int>
#define ff first
#define ss second

using namespace std;
const int maxn = 1e4 + 10;
vector<ii> adj[maxn];
int pa[maxn][20], dep[maxn], dis[maxn], p[maxn], vis[maxn], mark[maxn], n, m;
array<int, 4> e[maxn];

void DFS(int u = 1, int par = 0)
{
    vis[u] = 1;
    for (auto [v, id]: adj[u]) if (v != par && !vis[v])
    {
        mark[id] = 1;
        int c = e[id][0];
        dep[v] = dep[u] + 1;
        dis[v] = dis[u] + c;
        pa[v][0] = u;
        DFS(v, u);
    }
}

/**
Build tree with DFS tree, no cross edge
**/

inline int lca(int u, int v)
{
    if (dep[u] > dep[v]) swap(u, v);
    int dif = dep[v] - dep[u];
    for (int i=19; i>=0; i--) if (dif >> i & 1) v = pa[v][i];
    if (v == u) return u;
    for (int i=19; i>=0; i--) if (pa[v][i] != pa[u][i]) v = pa[v][i], u = pa[u][i];
    return pa[u][0];
}

inline int cal(int u, int v) {return dis[u] + dis[v] - 2 * dis[lca(u, v)];}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>n>>m;
    for (int i=1; i<=m; i++) cin>>e[i][1]>>e[i][2]>>e[i][0], e[i][3] = i;
    vector<int> ve;
    for (int i=1; i<=m; i++)
    {
        adj[e[i][1]].emplace_back(e[i][2], e[i][3]);
        adj[e[i][2]].emplace_back(e[i][1], e[i][3]);
    }
    for (int i=1; i<=n; i++) if (!vis[i]) DFS(i, 0);
    for (int i=1; i<=m; i++) if (!mark[i]) ve.emplace_back(i);

    for (int i=1; i<20; i++)
        for (int j=1; j<=n; j++)
            pa[j][i] = pa[pa[j][i-1]][i-1];

    int ans = 0;
    for (int i=0; i<ve.size()-1; i++)
        for (int j=i+1; j<ve.size(); j++)
        {
            auto [c1, u1, v1, id1] = e[ve[i]];
            auto [c2, u2, v2, id2] = e[ve[j]];

        }

    for (int i: ve)
    {
        auto [c, u, v, id] = e[i];
        ans = __gcd(ans, c + cal(u, v));
    }
    cout<<ans;
}