#include <cstdio>
#include <algorithm>
using namespace std;
#define Max 200002
 
struct muchie{ int x,y,c; } u[2*Max];
int n,m,rad[Max];
bool was[2*Max];
 
bool sort_type(muchie a,muchie b)
   { return a.c<b.c; }
 
int tata(int x)
{
    if(rad[x] != x)
		rad[x]=tata(rad[x]);
	
    return rad[x];
}
 
void apm()
{
 
    sort(u,u+m,sort_type);
	
    for(int i=1;i<=n;i++)
		rad[i]=i;
	
    int c=0,i=0;
    for(int k=1;k<n;k++)
    {
        while(tata(u[i].x)==tata(u[i].y))
			i++;
		
        c+=u[i].c;
        was[i]=1;
        rad[tata(u[i].x)]=tata(u[i].y);
        i++;
    }
    printf("%d\n",c);
    printf("%d\n",n-1);
	
    for(int i=0;i<m;i++)
    if(was[i])
		printf("%d %d\n",u[i].x,u[i].y);
}
 
int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
        scanf("%d %d",&n,&m);
 
        for(int i=0;i<m;i++) 
			scanf("%d",&u[i].x);
		
		for(int i=0;i<m;i++)
			scanf("%d",&u[i].y);
 
		for(int i=0;i<m;i++)
			scanf("%d",&u[i].c);
		
        apm();
 
    return 0;
}