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;
long double f(long long x) { return pow(x, 3. / 2.); }
long double df(long long x) { return 3. * sqrt(x); }
const int maxn = 2e5 + 79;
const long double inf = 1e18 + 79;
pair<long double, int> ans(inf, -1);
vector<int> w(maxn), s(maxn), out(maxn, 0);
vector<vector<pair<int, int> > > g(maxn);
vector<long double> d(maxn, 0.);
long double bruteforce(int v, int p, long long dist) {
  long double ans = (long double)(w[v]) * f(dist);
  for (pair<int, int> i : g[v])
    if (i.first != p) ans += bruteforce(i.first, v, dist + i.second);
  return ans;
}
int dfs_size(int v, int p) {
  s[v] = 1;
  for (pair<int, int> i : g[v])
    if (i.first != p && !out[i.first]) s[v] += dfs_size(i.first, v);
  return s[v];
}
int dfs_find_centroid(int v, int p, int start) {
  for (pair<int, int> i : g[v])
    if (i.first != p && !out[i.first] && s[i.first] * 2 > s[start])
      return dfs_find_centroid(i.first, v, start);
  return v;
}
void dfs_clear(int v, int p, int dont_clear) {
  out[v] = true;
  for (pair<int, int> i : g[v])
    if (i.first != dont_clear && i.first != p && !out[i.first])
      dfs_clear(i.first, v, dont_clear);
}
void dfs_calculate_derivates(int v, int p, int subtree, long long dist) {
  d[subtree] += df(dist) * (long double)w[v];
  for (pair<int, int> i : g[v])
    if (i.first != p)
      dfs_calculate_derivates(i.first, v, subtree, dist + i.second);
}
void solve(int v, int last) {
  dfs_size(v, -1);
  v = dfs_find_centroid(v, -1, v);
  pair<long double, int> p(bruteforce(v, -1, 0), v);
  if (ans.second == -1)
    ans = p;
  else
    ans = min(ans, p);
  if (s[v] == 1) return;
  pair<long double, int> next(-1, v);
  for (pair<int, int> i : g[v]) {
    if (out[i.first]) continue;
    dfs_calculate_derivates(i.first, v, i.first, i.second);
    next = max(next, {d[i.first], i.first});
  }
  for (pair<int, int> i : g[v]) {
    if (out[i.first]) continue;
    d[i.first] = 0.;
    if (i.first != next.second) dfs_clear(i.first, v, v);
  }
  out[v] = true;
  if (next.second != -1) solve(next.second, v);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> w[i];
  for (int i = 0, a, b, l; i < n - 1; i++)
    cin >> a >> b >> l, g[--a].push_back({--b, l}), g[b].push_back({a, l});
  solve(0, 0);
  cout << ans.second + 1 << " " << setprecision(20) << fixed << ans.first
       << "\n";
  return 0;
}
