#include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el endl #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define inp(x) for(auto &i:x)cin>>i #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll t;cin>>t; vs SS={"Same","Different","Unknown"}; while(t--){ ll n,m;cin>>n>>m; vvl G(2*n); rep(i,0,m){ ll a,b,c;cin>>a>>b>>c; a--;b--; if(c==1){ G[a].push_back(b); G[b].push_back(a); G[a+n].push_back(b+n); G[b+n].push_back(a+n); }else{ G[a].push_back(b+n); G[b+n].push_back(a); G[a+n].push_back(b); G[b].push_back(a+n); } } vl D(2*n,infl); D[0]=0; queue que; que.push(0); while(!que.empty()){ ll v=que.front();que.pop(); for(auto nv:G[v]){ if(D[nv]>D[v]+1){ D[nv]=D[v]+1; que.push(nv); } } } if(D[n-1]!=infl){ cout<