#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 200005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,m,k,h[N],cnt=1,q[N],d[N],l,r,ans,op,x,y,z;
char c[2];
struct edge{int v,n,w;}e[N<<1];
void ad(int u,int v,int w){e[++cnt]={v,h[u],w};h[u]=cnt;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void bfs()
{
	fo(i,1,n)d[i]=-1;
	d[1]=0;q[l=r=1]=1;
	while(l<=r)
	{
		int x=100,y=r;
		fo(i,l,r)
			for(int j=h[q[i]];j;j=e[j].n)
				x=min(x,e[j].w);
		fo(i,l,y)
			for(int j=h[q[i]];j;j=e[j].n)
			{
				if(e[j].w!=x)continue;
				int v=e[j].v;
				if(d[v]==-1)
					d[v]=d[q[i]]+1,
					q[++r]=v;
			}
		l=y+1;
	}
}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("Path.in","r",stdin);freopen("Path.out","w",stdout);
	T=read();
	while(T--)
	{
		n=read();m=read();
		while(m--)x=read(),y=read(),scanf("%s",c),ad(x,y,c[0]-97),ad(y,x,c[0]-97);
		bfs();
		fo(i,1,n){if(i!=1)printf(" ");printf("%lld",d[i]);}
		if(T)printf("\n");
		cnt=0;fo(i,1,n)h[i]=0;
	}
	return 0;
}