#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int M=1e5+10;
int n,m,k;
int c[M],had[M];
vector <int> G[M],C[M];
int u,v,vis[M];
void dfs(int a){
	if(c[a]==1){
		printf("%d ",a);
		return;
	}
	for(int u:G[a]){
		if(c[u]==c[a]-1){
			dfs(u);
			break;
		}
	}
	printf("%d ",a);
}
int bfs(int x){
	queue <int> Q;
	Q.push(x);
	c[x]=1;
	if(Q.empty()) return 0;
	int nowcol=1;
	while(!Q.empty()){
		int a=Q.front();Q.pop();
		had[a]=1;
		if(c[a]>nowcol)nowcol=c[a];
		vis[c[a]]=1;
		for(int v:G[a]){
			if(c[v]>=c[a]){
				c[v]=c[a]+1;
				Q.push(v);
			}
		}
	}
	return nowcol;
}
int main(){
	int T;
	for(scanf("%d",&T);T;T--){
		scanf("%d%d%d",&n,&m,&k);
		for(int i=1;i<=k;i++)vis[i]=had[i]=0,C[i].clear();
		for(int i=1;i<=n;i++){
			scanf("%d",&c[i]);
			G[i].clear();
			C[c[i]].push_back(i);
		}
		for(int i=1;i<=m;i++){
			scanf("%d%d",&u,&v);
			G[u].push_back(v);
			G[v].push_back(u);
		}
		int ans=0;
		for(int i=1;i<=n;i++){
			if(!had[i]){
				ans=max(ans,bfs(i));
			}
		}
		printf("%d ",ans);
		for(int i=1;i<=n;i++){
			printf("%d ",c[i]);
		}	printf("\n");
		for(int i=1;i<=n;i++){
			if(c[i]==ans){
				dfs(i);
				break;
			}
		}	printf("\n");
	}
	return 0;
}
/*
2
3 3 3
1 2 3
1 2
2 3
3 1
3 1 3
1 2 3
1 2
*/