#include <bits/stdc++.h>
using namespace std;
int n, wp;
int c[200005];
double ans = 1e50;
vector<pair<int, int> > g[200005];
inline int read() {
  int x = 0;
  char ch = getchar();
  while (!isdigit(ch)) ch = getchar();
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x;
}
int root, Size, mSize, siz[200005];
double dir, sum, sumd[200005];
bool vis[200005];
void getRoot(int u, int fa) {
  siz[u] = 1;
  int maxSize = 0;
  for (int i = g[u].size() - 1, v; ~i; --i) {
    v = g[u][i].first;
    if (v == fa || vis[v]) continue;
    getRoot(v, u), siz[u] += siz[v];
    maxSize = max(maxSize, siz[v]);
  }
  maxSize = max(maxSize, Size - siz[u]);
  if (maxSize < mSize) {
    mSize = maxSize;
    root = u;
  }
}
void getAns(int u, int fa, int dist) {
  sum += sqrt(dist) * dist * c[u];
  for (int i = g[u].size() - 1, v; ~i; --i) {
    v = g[u][i].first;
    if (v == fa) continue;
    getAns(v, u, dist + g[u][i].second);
  }
}
double getDir(int u, int fa, int dist) {
  double res = 1.5 * sqrt(dist) * c[u];
  for (int i = g[u].size() - 1, v; ~i; --i) {
    v = g[u][i].first;
    if (v == fa) continue;
    res += getDir(v, u, dist + g[u][i].second);
  }
  return res;
}
void solve(int u) {
  mSize = 200005;
  getRoot(u, u);
  vis[u = root] = true;
  sum = 0, getAns(u, u, 0);
  if (sum < ans) ans = sum, wp = u;
  dir = 0;
  for (int i = g[u].size() - 1, v; ~i; --i) {
    v = g[u][i].first;
    if (vis[v]) continue;
    sumd[v] = getDir(v, u, g[u][i].second);
    dir += sumd[v];
  }
  for (int i = g[u].size() - 1, v; ~i; --i) {
    v = g[u][i].first;
    if (vis[v] || dir - 2 * sumd[v] > 0) continue;
    Size = siz[v];
    solve(v);
    break;
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) c[i] = read();
  for (int i = 1, u, v, w; i < n; ++i) {
    u = read(), v = read(), w = read();
    g[u].push_back(make_pair(v, w));
    g[v].push_back(make_pair(u, w));
  }
  Size = n;
  solve(1);
  printf("%d %.8lf", wp, ans);
  return 0;
}
