3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < n - 1; ++i) {
    int v, u, w;
    cin >> v >> u >> w;
    --v;
    --u;
    g[v].emplace_back(u, w);
    g[u].emplace_back(v, w);
  }
  pair<double, int> ans(1e30, -1);
  vector<double> der(n);
  vector<bool> vis(n);
  vector<int> sz(n);
  vector<int> mx(n);
  auto find_root = [&](int r) {
    vector<int> ord;
    function<void(int, int)> dfs = [&](int v, int p) {
      ord.push_back(v);
      sz[v] = 1;
      mx[v] = 0;
      for (auto e : g[v]) {
        int u = e.first;
        if (!vis[u] && u != p) {
          dfs(u, v);
          sz[v] += sz[u];
          mx[v] = max(mx[v], sz[u]);
        }
      }
    };
    dfs(r, -1);
    int res = -1;
    for (int v : ord) {
      mx[v] = max(mx[v], sz[r] - sz[v]);
      if (res == -1 || mx[res] > mx[v]) {
        res = v;
      }
    }
    return res;
  };
  function<void(int)> centroid_decomposition = [&](int v) {
    vis[v = find_root(v)] = true;
    double res = 0;
    function<void(int, int, int, int)> dfs = [&](int v, int p, int d, int r) {
      res += sqrt(d) * d * a[v];
      der[r] += sqrt(d) * a[v];
      for (auto e : g[v]) {
        int u = e.first, w = e.second;
        if (u != p) {
          dfs(u, v, d + w, r);
        }
      }
    };
    double sum = 0;
    for (auto e : g[v]) {
      int u = e.first, w = e.second;
      der[u] = 0;
      dfs(u, v, w, u);
      sum += der[u];
    }
    ans = min(ans, make_pair(res, v));
    for (auto e : g[v]) {
      int u = e.first;
      if (!vis[u] && der[u] * 2 > sum) {
        centroid_decomposition(u);
      }
    }
  };
  centroid_decomposition(0);
  cout << ans.second + 1 << " " << fixed << setprecision(9) << ans.first
       << "\n";
  return 0;
}
