#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 #include<queue>

 #include<vector>

 #include<map>

 #include<set>

 #define ll long long

 #define db double

 #define inf 2139062143

 #define MAXN 50100

 #define MOD 998244353

 #define maxi 123456789123456789LL

 #define rep(i,s,t) for(register int i=(s),i##__end=(t);i<=i##__end;++i)

 #define dwn(i,s,t) for(register int i=(s),i##__end=(t);i>=i##__end;--i)

 #define ren for(register int i=fst[x];i;i=nxt[i])

 #define pb(i,x) vec[i].push_back(x)

 #define pls(a,b) (a+b)%MOD

 #define mns(a,b) (a-b+MOD)%MOD

 #define mul(a,b) (1LL*(a)*(b))%MOD

 using namespace std;

 inline ll read()

 {

     ll x=,f=;char ch=getchar();

     while(!isdigit(ch)) {if(ch=='-') f=-;ch=getchar();}

     while(isdigit(ch)) {x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 ll p[],dis[MAXN],val[MAXN<<];

 int n,m,fst[MAXN],to[MAXN<<],nxt[MAXN<<],cnt,vis[MAXN];

 void add(int u,int v,ll w) {nxt[++cnt]=fst[u],fst[u]=cnt,to[cnt]=v,val[cnt]=w;}

 void ins(ll x) {dwn(i,,) if((x>>i)&){if(!p[i]){p[i]=x;break;}x^=p[i];};}

 ll query(ll x) {ll res=x;dwn(i,,) res=max(res,res^p[i]);return res;}

 void dfs(int x)

 {

     vis[x]=;ren if(!vis[to[i]]) dis[to[i]]=dis[x]^val[i],dfs(to[i]);

         else ins(dis[x]^dis[to[i]]^val[i]);

 }

 int main()

 {

     n=read(),m=read();int a,b;ll c;

     rep(i,,m) a=read(),b=read(),c=read(),add(a,b,c),add(b,a,c);

     dfs();printf("%lld\n",query(dis[n]));

 }