static Edge findMinEdge(ArrayList<Integer> vNew,ArrayList<Integer> tos,int[][] dist){
		int answerTo=-1;
		int answerFrom=-1;
		int min=Integer.MAX_VALUE;
		for(int from: vNew){
			for(int to: tos){
				if(dist[from][to]<min){
					min=dist[from][to];
					answerTo=to;
					answerFrom=from;
				}
			}
		}
		return new Edge(answerFrom,answerTo,min);
	}