#pragma GCC optimize (2)

#pragma G++ optimize (2)

#pragma comment(linker, "/STACK:102400000,102400000")

#include<bits/stdc++.h>

#include<cstdio>

#include<vector>

#define rep(i,a,b) for(int i=a;i<=b;i++)

#define dep(i,b,a) for(int i=b;i>=a;i--)

#define clr(a,b) memset(a,b,sizeof(a))

#define pb push_back

#define pii pair<int,int >

using namespace std;

typedef long long ll;

const int inf=0x3f3f3f3f;

ll rd()

{

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

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

const int maxn=;

int n,m,vis[maxn];

struct edge{

    int to;

    ll w;

};

vector<edge >ve[maxn];

ll link,del[maxn];

ll p[];

void insert(ll res){

    dep(i,,){

        if((res>>i)&){

            if(!p[i]){

                p[i]=res;

                break;

            }

            res^=p[i];

        }

    }

}

ll query(ll x){

    dep(i,,){

        if((x^p[i])>x){

            x^=p[i];

        }

    }

    return x;

}

void dfs(int u,ll res){

    del[u]=res;

    vis[u]=;

    if(u==n){

        link=res;

    }

    for(auto &st:ve[u]){

        if(vis[st.to]){

            insert(res^st.w^del[st.to]);

        }else{

            dfs(st.to,res^st.w);

        }

    }

}

int main(){

    while(cin>>n>>m){

        rep(i,,n){

            ve[i].clear();

            vis[i]=;

        }

        rep(i,,m){

            int u=rd(),v=rd();

            ll w=rd();

            ve[u].pb({v,w}),ve[v].pb({u,w});

        }

        link=-;

        dfs(,);

        printf("%lld\n",query(link));

    }

}