#include<iostream>
#include<cstdio>
#include<vector>
#define N 10000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
long long gcd(long long x,long long y)
{
	if (!y) return x;
	return gcd(y,x%y);
}
struct reads
{
	int num,data;
};
struct rds
{
	int x,y,data;
};
rds tong[N+1];
int n,m,length,lg[N+1],fa[N+1],st[N+1],leng,lengs,ps[N+1],dfn[N+1],rev[N+1],ST[N+1][21];
long long d,depth[N+1];
vector<reads>E[N+1];
void add(int x,int y,int z)
{
	E[x].push_back((reads){y,z}),E[y].push_back((reads){x,z});
	return;
}
void dfs(int x)
{
	dfn[x]=++leng,rev[dfn[x]]=x;
	for (int i=0;i<E[x].size();++i)
	{
		if (x<E[x][i].num) tong[++length]=(rds){x,E[x][i].num,E[x][i].data};
		if (!dfn[E[x][i].num]) fa[E[x][i].num]=x,depth[E[x][i].num]=depth[x]+E[x][i].data,dfs(E[x][i].num);
	}
	return;
}
void dfs2(int x)
{
	st[++lengs]=x,ps[x]=lengs;
	for (int i=0;i<E[x].size();++i)
		if (fa[E[x][i].num]==x)
			dfs2(E[x][i].num),st[++lengs]=x;
	return;
}
int query(int l,int r)
{
	int lw=lg[r-l+1];
	return min(ST[l][lw],ST[r-(1<<lw)+1][lw]);
}
int lca(int x,int y)
{
	x=ps[x],y=ps[y];
	if (x>y) swap(x,y);
	return rev[query(x,y)];
}
int main()
{
	int x,y,z;
	for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
	n=read(),m=read();
	for (int i=1;i<=m;++i) x=read(),y=read(),z=read(),add(x,y,z);
	for (int i=1;i<=n;++i)
		if (!dfn[i])
		{
			leng=lengs=length=0,dfs(i),dfs2(i);
			for (int j=1;j<=lengs;++j) ST[j][0]=dfn[st[j]];
			for (int j=1;j<=lg[lengs];++j)
				for (int k=1;k+(1<<j)-1<=lengs;++k)
					ST[k][j]=min(ST[k][j-1],ST[k+(1<<(j-1))][j-1]);
			for (int j=1;j<=length;++j)
			{
				if (depth[tong[j].x]>depth[tong[j].y]) swap(tong[j].x,tong[j].y);
				if (fa[tong[j].y]!=tong[j].x) d=gcd(d,depth[tong[j].y]-depth[tong[j].x]+tong[j].data);
			}
			for (int j=1;j<=length;++j)
				if (fa[tong[j].y]!=tong[j].x)
					for (int k=j+1;k<=length;++k)
						if (fa[tong[k].y]!=tong[k].x)
							d=gcd(d,max(depth[lca(tong[j].y,tong[k].y)]-max(depth[tong[j].x],depth[tong[k].y]),0ll));
		}
	printf("%lld\n",d);
	return 0;
}