#include "testlib.h"
#include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)

const int MIN_N = 2;
const int MAX_N = 100;
const int MAX_M = 100;
const int MIN_D = 1;
const int MAX_D = 1e8;
const int MIN_c = 1;
const int MAX_c = 1e8;
const int MIN_d = 1;
const int MAX_d = 1e8;


struct UnionFind {
  vector<int> d;
  int m; // number of connected components
  UnionFind(int n = 0) : d(n, -1), m(n) {}
  int find(int x) {
    if (d[x] < 0) return x;
    return d[x] = find(d[x]);
  }
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (d[x] > d[y]) swap(x, y);
    d[x] += d[y];
    d[y] = x;
    --m;
    return true;
  }
  bool same(int x, int y) { return find(x) == find(y); }
  int size(int x) { return -d[find(x)]; }
};


signed main(int argc, char* argv[]) {
  registerValidation(argc, argv);
  int N = inf.readInt(MIN_N, MAX_N, "N");
  inf.readSpace();
  int M = inf.readInt(N-1, MAX_M, "M");
  inf.readSpace();
  int D = inf.readInt(MIN_D, MAX_D, "D");
  inf.readEoln();

  set<pair<int, int>> S;
  UnionFind uf(N);

  rep(i, M) {
    int a = inf.readInt(1, N, "a");
    inf.readSpace();
    int b = inf.readInt(1, N, "b");
    inf.readSpace();
    int c = inf.readInt(MIN_c, MAX_c, "c");
    inf.readSpace();
    int d = inf.readInt(MIN_d, MAX_d, "d");
    inf.readEoln();

    assert(S.find({a, b}) == S.end());
    assert(S.find({b, a}) == S.end());
    S.emplace(a, b);
    uf.unite(a, b);
  }
  assert(uf.m == 1);
  inf.readEof();
}