#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;
}
