#include<cstdio>

#include<iostream>

#include<cstring>

#include<cmath>

#include<cctype>

#include<algorithm>

using namespace std;

typedef long long ll;

const int N=;

const int M=;

const int BASE=;

inline ll read(){

    ll X=,w=;char ch=;

    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}

    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();

    return w?-X:X;

}

struct node{

    int to,nxt;

    ll w;

}e[M];

int cnt,n,m,head[N],tot,num;

ll a[M],b[BASE+],s[M],t[M];

bool vis[N];

inline void add(int u,int v,ll w){

    e[++cnt].to=v;e[cnt].w=w;e[cnt].nxt=head[u];head[u]=cnt;

}

void dfs(int u,ll sum){

    vis[u]=;t[u]=sum;

    for(int i=head[u];i;i=e[i].nxt){

    int v=e[i].to;ll w=e[i].w;

    ll ans=sum^w^t[v];

    if(vis[v]){

        if(ans)a[++tot]=ans;

        continue;

    }

    dfs(v,sum^w);

    }

    if(u==n)s[++num]=sum;

    return;

}

int main(){

    n=read(),m=read();

    for(int i=;i<=m;i++){

    int u=read(),v=read();ll w=read();

    add(u,v,w);add(v,u,w);

    }

    dfs(,);

    for(int i=;i<=tot;i++){

    for(int j=BASE;j>=;j--){

        if(a[i]>>j&){

        if(b[j])a[i]^=b[j];

        else{

            b[j]=a[i];

            break;

        }

        }

    }

    }

    ll ans=;

    for(int i=;i<=num;i++){

    ll tmp=s[i];

    for(int j=BASE;j>=;j--){

        tmp=max(tmp,tmp^b[j]);

    }

    ans=max(ans,tmp);

    }

    printf("%lld\n",ans);

    return ;

}