#include <bits/stdc++.h>
using namespace std;
inline long long add(long long a, long long b) {
  return ((a % 1000000007LL) + (b % 1000000007LL)) % 1000000007LL;
}
inline long long mul(long long a, long long b) {
  return ((a % 1000000007LL) * (b % 1000000007LL)) % 1000000007LL;
}
inline long long sub(long long a, long long b) {
  return ((a % 1000000007LL) - (b % 1000000007LL) + 1000000007LL) %
         1000000007LL;
}
struct Node {
  long long u, v, w;
};
bool compare(Node A, Node B) { return A.w > B.w; }
int sectionInd[5001][5001];
vector<long long> path;
bool dfs(long long i, long long v, long long p, vector<long long> adj[]) {
  if (i == v) {
    return true;
  }
  bool ret = false;
  for (auto it : adj[i]) {
    if (it == p) {
      continue;
    }
    ret = dfs(it, v, i, adj);
    if (ret) {
      path.push_back(it);
      return true;
    }
  }
  return ret;
}
void Flash() {
  long long n;
  cin >> n;
  vector<long long> adj[n];
  long long u, v, minBeauty, ind;
  for (long long i = 0; i < n - 1; i++) {
    cin >> u >> v;
    --u, --v;
    adj[u].push_back(v), adj[v].push_back(u);
    sectionInd[u][v] = i;
    sectionInd[v][u] = i;
  }
  long long ans[n - 1];
  for (long long i = 0; i < n - 1; i++) {
    ans[i] = 1000000LL;
  }
  long long m;
  cin >> m;
  bool chk = false;
  Node queries[m];
  for (long long i = 0; i < m; i++) {
    cin >> u >> v >> minBeauty;
    --u, --v;
    queries[i].u = u, queries[i].v = v, queries[i].w = minBeauty;
  }
  sort(queries, queries + m, compare);
  for (long long i = 0; i < m; i++) {
    u = queries[i].u, v = queries[i].v, minBeauty = queries[i].w;
    path.clear();
    dfs(u, v, u, adj);
    path.push_back(u);
    chk = false;
    for (long long i = 0; i < path.size() - 1; i++) {
      ind = sectionInd[path[i]][path[i + 1]];
      if (ans[ind] == 1000000LL || ans[ind] == minBeauty) {
        chk = true;
        ans[ind] = minBeauty;
      }
    }
    if (!chk) {
      cout << "-1\n";
      return;
    }
  }
  for (long long i = 0; i < n - 1; i++) {
    cout << ans[i] << " ";
  }
  cout << "\n";
}
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
  ;
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    Flash();
  }
  return 0;
}

### Prompt

Your task is to create a CPP solution to the following problem:

There are n railway stations in Berland. They are connected to each other by n-1 railway sections. The railway network is connected, i.e. can be represented as an undirected tree.

You have a map of that network, so for each railway section you know which stations it connects.

Each of the n-1 sections has some integer value of the scenery beauty. However, these values are not marked on the map and you don't know them. All these values are from 1 to 10^6 inclusive.

You asked m passengers some questions: the j-th one told you three values:

  * his departure station a_j; 
  * his arrival station b_j; 
  * minimum scenery beauty along the path from a_j to b_j (the train is moving along the shortest path from a_j to b_j). 



You are planning to update the map and set some value f_i on each railway section — the scenery beauty. The passengers' answers should be consistent with these values.

Print any valid set of values f_1, f_2, ..., f_{n-1}, which the passengers' answer is consistent with or report that it doesn't exist.

Input

The first line contains a single integer n (2 ≤ n ≤ 5000) — the number of railway stations in Berland.

The next n-1 lines contain descriptions of the railway sections: the i-th section description is two integers x_i and y_i (1 ≤ x_i, y_i ≤ n, x_i ≠ y_i), where x_i and y_i are the indices of the stations which are connected by the i-th railway section. All the railway sections are bidirected. Each station can be reached from any other station by the railway.

The next line contains a single integer m (1 ≤ m ≤ 5000) — the number of passengers which were asked questions. Then m lines follow, the j-th line contains three integers a_j, b_j and g_j (1 ≤ a_j, b_j ≤ n; a_j ≠ b_j; 1 ≤ g_j ≤ 10^6) — the departure station, the arrival station and the minimum scenery beauty along his path.

Output

If there is no answer then print a single integer -1.

Otherwise, print n-1 integers f_1, f_2, ..., f_{n-1} (1 ≤ f_i ≤ 10^6), where f_i is some valid scenery beauty along the i-th railway section.

If there are multiple answers, you can print any of them.

Examples

Input


4
1 2
3 2
3 4
2
1 2 5
1 3 3


Output


5 3 5


Input


6
1 2
1 6
3 1
1 5
4 1
4
6 1 3
3 4 1
6 5 2
1 2 5


Output


5 3 1 2 1 


Input


6
1 2
1 6
3 1
1 5
4 1
4
6 1 1
3 4 3
6 5 3
1 2 4


Output


-1

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
inline long long add(long long a, long long b) {
  return ((a % 1000000007LL) + (b % 1000000007LL)) % 1000000007LL;
}
inline long long mul(long long a, long long b) {
  return ((a % 1000000007LL) * (b % 1000000007LL)) % 1000000007LL;
}
inline long long sub(long long a, long long b) {
  return ((a % 1000000007LL) - (b % 1000000007LL) + 1000000007LL) %
         1000000007LL;
}
struct Node {
  long long u, v, w;
};
bool compare(Node A, Node B) { return A.w > B.w; }
int sectionInd[5001][5001];
vector<long long> path;
bool dfs(long long i, long long v, long long p, vector<long long> adj[]) {
  if (i == v) {
    return true;
  }
  bool ret = false;
  for (auto it : adj[i]) {
    if (it == p) {
      continue;
    }
    ret = dfs(it, v, i, adj);
    if (ret) {
      path.push_back(it);
      return true;
    }
  }
  return ret;
}
void Flash() {
  long long n;
  cin >> n;
  vector<long long> adj[n];
  long long u, v, minBeauty, ind;
  for (long long i = 0; i < n - 1; i++) {
    cin >> u >> v;
    --u, --v;
    adj[u].push_back(v), adj[v].push_back(u);
    sectionInd[u][v] = i;
    sectionInd[v][u] = i;
  }
  long long ans[n - 1];
  for (long long i = 0; i < n - 1; i++) {
    ans[i] = 1000000LL;
  }
  long long m;
  cin >> m;
  bool chk = false;
  Node queries[m];
  for (long long i = 0; i < m; i++) {
    cin >> u >> v >> minBeauty;
    --u, --v;
    queries[i].u = u, queries[i].v = v, queries[i].w = minBeauty;
  }
  sort(queries, queries + m, compare);
  for (long long i = 0; i < m; i++) {
    u = queries[i].u, v = queries[i].v, minBeauty = queries[i].w;
    path.clear();
    dfs(u, v, u, adj);
    path.push_back(u);
    chk = false;
    for (long long i = 0; i < path.size() - 1; i++) {
      ind = sectionInd[path[i]][path[i + 1]];
      if (ans[ind] == 1000000LL || ans[ind] == minBeauty) {
        chk = true;
        ans[ind] = minBeauty;
      }
    }
    if (!chk) {
      cout << "-1\n";
      return;
    }
  }
  for (long long i = 0; i < n - 1; i++) {
    cout << ans[i] << " ";
  }
  cout << "\n";
}
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
  ;
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    Flash();
  }
  return 0;
}

```