#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- template class UF { public: vector par,rank,cnt,G[um]; UF() {par=rank=vector(um,0); cnt=vector(um,1); for(int i=0;irank[y]) return par[x]=y; rank[x]+=rank[x]==rank[y]; return par[y]=x; } }; UF<202020> uf; vector E[202020]; int T,N,M; int A[202020],B[202020],C[202020]; int dp[2][202020]; void solve() { int i,j,k,l,r,x,y; string s; cin>>T; while(T--) { cin>>N>>M; uf.reinit(N); FOR(i,N) { E[i].clear(); dp[0][i]=dp[1][i]=1<<20; } FOR(i,M) { cin>>A[i]>>B[i]>>C[i]; A[i]--,B[i]--; if(C[i]==1) { uf(A[i],B[i]); E[A[i]].push_back(B[i]); E[B[i]].push_back(A[i]); } } dp[0][0]=dp[1][N-1]=0; queue Q; Q.push(0); Q.push((N-1)*2+1); while(Q.size()) { int cur=Q.front()/2; int id=Q.front()%2; Q.pop(); FORR(e,E[cur]) if(chmin(dp[id][e],dp[id][cur]+1)) Q.push(e*2+id); } if(dp[0][N-1]<1<<20) { cout<<"Same"<