#include <bits/stdc++.h>

using namespace std;

ifstream fin("flood.in");
ofstream fout("flood.out");

int n,m,p,t[10003];
struct Muchie
{
    int x,y,cost;
    bool check;
    bool operator<(const Muchie &A) const
    {
        return cost < A.cost;
    }
};
Muchie a[400003];

void Citire()
{
    int i,j;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a[i].x>>a[i].y;
        a[i].cost = -1;
    }
    fin>>p;
    for(;i<=m+p;i++)
        fin>>a[i].x>>a[i].y>>a[i].cost;

}

void Union(int x, int y)
{
    t[y] = x;
}

int Find(int x)
{
    int rad,y;
    rad = x;
    while(t[rad] != 0)
        rad = t[rad];

    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}

void Rezolvare()
{
    int i,nrcc,x,y,nrd,cmin;
    sort(a+1,a+m+p+1);
    nrcc = n;
    nrd = cmin = 0;
    for(i=1;i<=m + p && nrcc>1;i++)
    {
        x = Find(a[i].x);
        y = Find(a[i].y);
        if(x != y)
        {
            a[i].check = true;
            if(a[i].cost != -1)
            {
                cmin += a[i].cost;
                nrd++;
            }
            Union(x,y);
            nrcc--;
        }
    }

    fout << nrd << "\n" << cmin << "\n";
    for(i = 1; i <= m + p; i++)
        if(a[i].cost != -1 && a[i].check == true)
            fout << a[i].x << " " << a[i].y << " "<< a[i].cost <<"\n";
}

int main()
{
    Citire();
    Rezolvare();

    fin.close();
    fout.close();
    return 0;
}