#include <stdio.h>
#include <assert.h>

#define DBG(x)

FILE *input;
int n,t;
char nam[20][300];
int acc[20];
int num=0;

int read_case() {
  int i,w;
  int j,j1,j2;
  char s1[300],s2[300];
  fscanf(input,"%d %d",&n,&t);
  if (n==0) return 0;
  for (i=0;i<n;i++)
    fscanf(input,"%s",nam[i]);
  for (i=0;i<t;i++) {
    fscanf(input,"%s %s %d",s1,s2,&w);
    for (j=0;j<n;j++) {
      if (strcmp(s1,nam[j])==0) j1=j;
      if (strcmp(s2,nam[j])==0) j2=j;
    }
    acc[j1]-=w;
    acc[j2]+=w;
  }
  DBG(
      for (i=0;i<n;i++)
      printf("%s %d\n",nam[i],acc[i]);
      );
  return -1;
}

void equ(int i) {
  int j;
  for (j=i;j<n;j++) {
    if (acc[i]==-acc[j] && acc[i]!=0) {
      if (acc[i]<acc[j]) 
	printf("%s %s %d\n",nam[j],nam[i],acc[j]);
      else
	printf("%s %s %d\n",nam[i],nam[j],acc[i]);
      acc[i]=acc[j]=0;
    }
  }
}

void solve_case() {
  int i,j;
  int st=1;
  printf("Case #%d\n",++num);
  for (i=0;i<n-1;i++) 
    equ(i);
  while(st) {
    st=0;
    for (i=0;i<n;i++) {
      for (j=0;j<n;j++) {
	if (acc[i]<0 && acc[j]>0) {
	  if (acc[j]<-acc[i]) {
	    printf("%s %s %d\n",nam[j],nam[i],acc[j]);
	    acc[i]+=acc[j];
	    acc[j]=0;
	    equ(i);
	    st=1;
	  }
	  else if (acc[j]>-acc[i]) {
	    printf("%s %s %d\n",nam[j],nam[i],-acc[i]);
	    acc[j]-=acc[i];
	    acc[i]=0;
	    equ(j);
	    st=1;
	  }
	}
      }
    }
  }
  printf("\n");
}

int main() {
  input=fopen("balance.in","r");
  assert(input!=NULL);
  while(read_case()) solve_case();
  fclose(input);
  return 0;
}