#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef pair<ll,ll> P;

inline ll read()  //IO优化中的int要改为LL！！！

{

    char ch;ll num,f=;

    while(!isdigit(ch=getchar())) f|=(ch=='-');

    num=ch-'';

    while(isdigit(ch=getchar())) num=num*+ch-'';

    return f?-num:num;

}

#define F first

#define S second

const int MAXN=5e4+;

const int MAXM=2e5+;

vector<P> G[MAXN];

int n,m;

bool vis[MAXN];

ll dist[MAXN],base[],cir[MAXM],res,cnt=;

void dfs(int x)

{

    vis[x]=true;

    for(int i=;i<G[x].size();i++)  //寻找返祖边

    {

        P v=G[x][i];

        if(!vis[v.F]) dist[v.F]=dist[x]^v.S,dfs(v.F);

        else cir[++cnt]=dist[x]^dist[v.F]^v.S;

    }

}

int main()

{

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

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

    {

        ll x=read(),y=read(),z=read();

        G[x].push_back(P(y,z));

        G[y].push_back(P(x,z));

    }

    dfs();res=dist[n];

    for(int i=;i<=cnt;i++)  //构建线性基

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

        {

            if(!(cir[i]>>j)) continue;

            if(!base[j]){base[j]=cir[i];break;}

            cir[i]^=base[j];

        }

    for(int i=;i>=;i--) res=max(res,res^base[i]);

    cout << res;

    return ;

}