#include <vector>
#include <algorithm>
#include <iostream>
#include <utility>
#include <queue>

std::vector<std::vector<int>> Transpose(int nodes, const std::vector<std::vector<int>>& edges) {
    std::vector<std::vector<int>> new_edges(nodes);

    for (int node = 0; node < nodes; ++node) {
        for (auto end : edges[node]) {
            new_edges[end].push_back(node);
        }
    }
    return new_edges;
}

int Condense(const std::vector<std::vector<int>>& edges,
    const std::vector<int>& colors, int nodes_number) {
    std::vector<int> components(nodes_number);
    std::vector<int> com_edges(nodes_number);
    size_t sz = edges.size();
    for (size_t node = 0; node < sz; ++node) {
        int new_node = colors[node] - 1;
        components[new_node] += 1;
        for (auto elem : edges[node]) {
            if (colors[node] != colors[elem]) {
                com_edges[colors[elem] - 1] = 1;
            }
        }
    }
    int min = sz;
    for (int i = 0; i < nodes_number; ++i) {
        if (com_edges[i] == 0) {
            min = std::min(min, components[i]);
        }
    }
    return min;
}


void dfs_f(const std::vector<std::vector<int>>& edges, std::vector<int>& visited,
                    std::vector<int>& order, int node) {
    visited[node] = 1;
    for (auto elem : edges[node]) {
        if (visited[elem] == 0) {
            dfs_f(edges, visited, order, elem);
        }
    }
    order.push_back(node);
}

void dfs_s(const std::vector<std::vector<int>>& edges, std::vector<int>& visited,
                     int node, int color) {
    visited[node] = color;
    for (auto elem : edges[node]) {
        if (visited[elem] == 0) {
            dfs_s(edges, visited, elem, color);
        }
    }
}

int FindStronglyConnectedComponents(int nodes, const std::vector<std::vector<int>>& edges) {
    std::vector<int> visited(nodes, 0);
    std::vector<int> order;
    for (int i = 0; i < nodes; ++i) {
        if (visited[i] == 0) {
            dfs_f(edges, visited, order, i);
        }
    }
    std::reverse(order.begin(), order.end());


    std::vector<std::vector<int>> tr_graph = Transpose(nodes, edges);

    std::vector<int> colors(nodes, 0);

    int color = 1;
    for (auto node : order) {
        if (colors[node] == 0) {
            dfs_s(tr_graph, colors, node, color);
            color++;
        }
    }

    return Condense(edges, colors, color - 1);
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);


    Graph graph = Read_graph();


    int nn, mm, fn, sn, res;
    std::cin >> nn >> mm;
    std::vector<std::vector<int>> edges(nn);
    for (int i = 0; i < mm; ++i) {
        std::cin >> fn >> sn >> res;
        if (res == 1) {
            edges[fn - 1].push_back(sn - 1);
        }
        if (res == 2) {
            edges[sn - 1].push_back(fn - 1);
        }
    }
    std::cout << nn + 1 - FindStronglyConnectedComponents(nn, edges) << std::endl;
    return 0;
}