import java.io.*;
import java.util.*;
public class Solution {
	public static void main(String[] argvs) throws NumberFormatException, IOException
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		//BufferedReader br=new BufferedReader(new InputStreamReader(new FileInputStream("D:/1.txt")));
		
		int CASE=Integer.valueOf(br.readLine());
		for(;CASE>0;CASE--)
		{
			String[] strs=br.readLine().split(" ");
			int n=Integer.valueOf(strs[0]);
			int m=Integer.valueOf(strs[1]);
			int k=Integer.valueOf(strs[2]);
			HashMap<Integer,ArrayList<point>> graph=new HashMap<Integer,ArrayList<point>>();
			int[] nums=new int[n];
			for(int i=0;i<=m-1;i++)
			{
				strs=br.readLine().split(" ");
				nums[Integer.valueOf(strs[0])]++;
				nums[Integer.valueOf(strs[1])]++;
				point p1=new point(Integer.valueOf(strs[0]),1);
				point p2=new point(Integer.valueOf(strs[1]),1);
				ArrayList<point> al=graph.get(Integer.valueOf(strs[1]));
				if(al==null)
				{
					al=new ArrayList<point>();
					graph.put(Integer.valueOf(strs[1]), al);
				}
				al.add(p1);
				al=graph.get(Integer.valueOf(strs[0]));
				if(al==null)
				{
					al=new ArrayList<point>();
					graph.put(Integer.valueOf(strs[0]), al);
				}
				al.add(p2);
			}
			for(Integer key : graph.keySet())
			{
				ArrayList<point> al=graph.get(key);
				for(int i=0;i<=al.size()-1;i++)
				{
					al.get(i).value/=nums[al.get(i).y];
					//System.out.println(key+" "+i+" "+al.get(i).value);
				}
			}
			double[] newarray=new double[n];
			double[] old=new double[n];
			for(int i=0;i<=n-1;i++)
			{
				newarray[i]=-1;
				old[i]=Integer.valueOf(br.readLine());
			}
			for(int i=0;i<=k-1;i++)
			{
				for(int j=0;j<=n-1;j++)
				{
					double t=0;
					ArrayList<point> al=graph.get(j);
					if(al==null)
					{
						newarray[j]=0;
						continue;
					}
					for(int h=0;h<=al.size()-1;h++)
					{
						t+=al.get(h).value*old[al.get(h).y];
					}
					newarray[j]=t;
				}
				if(canfinish(newarray,old))
				{
					break;
				}
				old=newarray;
				newarray=new double[n];
			}
			ArrayList<Integer> al=new ArrayList<Integer>();
			for(int i=0;i<=old.length-1;i++)
			{
			al.add(near(old[i]));
			
			}
			Collections.sort(al);
			for(int i=0;i<=4 ;i++)
			{
				System.out.print(al.get(al.size()-1-i)+" ");
			}
                    System.out.println();
		}
		
	}
	private static boolean canfinish(double[] a1,double[] a2)
	{
		for(int i=0;i<=a1.length-1;i++)
		{
			if(near(a1[i])!=near(a2[i]))
				return false;
		}
		return true;
	}
	private static int near(double a)
	{
		if(a-(int)a>0.5)
		{
			return (int)a+1;
		}
		return (int)a;
	}
	private static class point
	{
		int y;
		double value;
		public point(int a,double b)
		{
			y=a;
			value=b;
		}
	}
}