#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>

using namespace std;

const int MAXN=333;

int n,m,i,j,k,DAT,a[MAXN][MAXN];
bool flag;

int main()
{
	freopen("line.in","r",stdin);
	freopen("line.out","w",stdout);
	scanf("%d",&DAT);
	while (DAT--)
	{
		scanf("%d%d",&n,&m);
		for (i=1;i<=n;i++)
			for (j=1;j<=n;j++)
				a[i][j]=2;
		while (m--)
		{
			scanf("%d%d%d",&i,&j,&k);
			a[i][j]=k;
			a[j][i]=k;
		}
		flag=true;
		for (k=1;k<=n;k++)
			for (i=1;i<=n;i++)
				for (j=1;j<=n;j++)
					if (a[i][j]==2)
					{
						if (a[i][k]!=2 && a[k][j]!=2) a[i][j]=a[i][k] ^ a[k][j];
					}
					else
						if (a[i][k]!=2 && a[k][j]!=2 && a[i][k] ^ a[k][j]!=a[i][j]) flag=false;
		if (!flag) printf("No Answer\n");
		else printf("%d\n",a[1][n]);
	}
	return 0;
}